./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0610.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_0610.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 25249e4a5dfcdfed2078f190bfb36f4672db41bdb03e03d1de22de138ec215e0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:39:24,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:39:24,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:39:24,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:39:24,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:39:24,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:39:24,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:39:24,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:39:24,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:39:24,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:39:24,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:39:24,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:39:24,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:39:24,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:39:24,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:39:24,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:39:24,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:39:24,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:39:24,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:39:24,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:39:24,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:39:24,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:39:24,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:39:24,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:39:24,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:39:24,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:39:24,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:39:24,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:39:24,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:39:24,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:39:24,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:39:24,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:39:24,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:39:24,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:39:24,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:39:24,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:39:24,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:39:24,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:39:24,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:39:24,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:39:24,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:39:24,582 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:39:24,613 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:39:24,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:39:24,614 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:39:24,614 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:39:24,615 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:39:24,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:39:24,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:39:24,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:39:24,616 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:39:24,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:39:24,617 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:39:24,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:39:24,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:39:24,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:39:24,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:39:24,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:39:24,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:39:24,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:39:24,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:39:24,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:39:24,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:39:24,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:39:24,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:39:24,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:39:24,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:24,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:39:24,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:39:24,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:39:24,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:39:24,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:39:24,621 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:39:24,621 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:39:24,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:39:24,621 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 -> 25249e4a5dfcdfed2078f190bfb36f4672db41bdb03e03d1de22de138ec215e0 [2022-02-20 16:39:24,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:39:24,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:39:24,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:39:24,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:39:24,837 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:39:24,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0610.c [2022-02-20 16:39:24,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf7a77da/d02af76c2e0a4095a200f3bea7527603/FLAGa0b41fef7 [2022-02-20 16:39:25,353 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:39:25,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0610.c [2022-02-20 16:39:25,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf7a77da/d02af76c2e0a4095a200f3bea7527603/FLAGa0b41fef7 [2022-02-20 16:39:25,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caf7a77da/d02af76c2e0a4095a200f3bea7527603 [2022-02-20 16:39:25,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:39:25,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:39:25,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:25,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:39:25,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:39:25,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13de9b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25, skipping insertion in model container [2022-02-20 16:39:25,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:39:25,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:39:25,561 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_0610.c[3190,3203] [2022-02-20 16:39:25,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:25,584 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:39:25,611 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_0610.c[3190,3203] [2022-02-20 16:39:25,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:25,625 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:39:25,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25 WrapperNode [2022-02-20 16:39:25,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:25,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:25,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:39:25,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:39:25,633 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:39:25" (1/1) ... [2022-02-20 16:39:25,642 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:39:25" (1/1) ... [2022-02-20 16:39:25,688 INFO L137 Inliner]: procedures = 19, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-02-20 16:39:25,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:25,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:39:25,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:39:25,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:39:25,702 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:39:25,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:39:25,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:39:25,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:39:25,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (1/1) ... [2022-02-20 16:39:25,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:25,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:39:25,770 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:39:25,778 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:39:25,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:39:25,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:39:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:39:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:39:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:39:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:39:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:39:25,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:39:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:39:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:39:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:39:25,877 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:39:25,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:39:26,239 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:39:26,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:39:26,245 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:39:26,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:26 BoogieIcfgContainer [2022-02-20 16:39:26,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:39:26,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:39:26,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:39:26,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:39:26,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:39:25" (1/3) ... [2022-02-20 16:39:26,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443c78fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:26, skipping insertion in model container [2022-02-20 16:39:26,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:25" (2/3) ... [2022-02-20 16:39:26,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443c78fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:26, skipping insertion in model container [2022-02-20 16:39:26,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:26" (3/3) ... [2022-02-20 16:39:26,254 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0610.c [2022-02-20 16:39:26,259 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:39:26,259 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:39:26,308 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:39:26,321 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:39:26,322 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:39:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 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:39:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:39:26,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:26,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:26,350 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:26,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:26,354 INFO L85 PathProgramCache]: Analyzing trace with hash -897879539, now seen corresponding path program 1 times [2022-02-20 16:39:26,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:26,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943845766] [2022-02-20 16:39:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:26,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~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; {39#true} is VALID [2022-02-20 16:39:26,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_#t~ret28#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.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; {39#true} is VALID [2022-02-20 16:39:26,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-02-20 16:39:26,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#false} assume 0 == atan_float_~hx~0#1;atan_float_~ix~1#1 := 0; {40#false} is VALID [2022-02-20 16:39:26,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#false} assume atan_float_~ix~1#1 >= 1350565888; {40#false} is VALID [2022-02-20 16:39:26,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#false} assume atan_float_~ix~1#1 > 2139095040;atan_float_#res#1 := ~someBinaryArithmeticFLOAToperation(atan_float_~x#1, atan_float_~x#1); {40#false} is VALID [2022-02-20 16:39:26,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#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;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {40#false} is VALID [2022-02-20 16:39:26,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#false} main_#t~ret28#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret28#1 && main_#t~ret28#1 <= 2147483647; {40#false} is VALID [2022-02-20 16:39:26,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#false} assume 0 == main_#t~ret28#1;havoc main_#t~ret28#1; {40#false} is VALID [2022-02-20 16:39:26,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:39:26,548 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:39:26,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:39:26,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943845766] [2022-02-20 16:39:26,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943845766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:26,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:26,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:39:26,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179783454] [2022-02-20 16:39:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:26,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:26,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:26,588 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:39:26,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:39:26,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:39:26,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:39:26,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:26,608 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 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 5.0) internal successors, (10), 2 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:39:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:26,669 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2022-02-20 16:39:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:39:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2022-02-20 16:39:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2022-02-20 16:39:26,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2022-02-20 16:39:26,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:26,791 INFO L225 Difference]: With dead ends: 70 [2022-02-20 16:39:26,791 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:39:26,793 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:39:26,798 INFO L933 BasicCegarLoop]: 48 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, 48 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:39:26,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:39:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:39:26,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:26,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:39:26,827 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:39:26,827 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:39:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:26,831 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 16:39:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 16:39:26,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:26,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:26,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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 33 states. [2022-02-20 16:39:26,833 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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 33 states. [2022-02-20 16:39:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:26,836 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 16:39:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 16:39:26,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:26,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:26,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:26,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:39:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-02-20 16:39:26,841 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 10 [2022-02-20 16:39:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:26,841 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-02-20 16:39:26,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 16:39:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:39:26,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:26,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:26,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:39:26,843 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:26,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1061780560, now seen corresponding path program 1 times [2022-02-20 16:39:26,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:26,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982562240] [2022-02-20 16:39:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:26,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~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; {229#true} is VALID [2022-02-20 16:39:26,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_#t~ret28#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.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; {229#true} is VALID [2022-02-20 16:39:26,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#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; {229#true} is VALID [2022-02-20 16:39:26,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#true} goto; {229#true} is VALID [2022-02-20 16:39:26,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {229#true} assume 0 == atan_float_~hx~0#1;atan_float_~ix~1#1 := 0; {231#(= |ULTIMATE.start_atan_float_~ix~1#1| 0)} is VALID [2022-02-20 16:39:26,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(= |ULTIMATE.start_atan_float_~ix~1#1| 0)} assume atan_float_~ix~1#1 >= 1350565888; {230#false} is VALID [2022-02-20 16:39:26,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#false} assume atan_float_~ix~1#1 > 2139095040;atan_float_#res#1 := ~someBinaryArithmeticFLOAToperation(atan_float_~x#1, atan_float_~x#1); {230#false} is VALID [2022-02-20 16:39:26,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#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;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {230#false} is VALID [2022-02-20 16:39:26,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#false} main_#t~ret28#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret28#1 && main_#t~ret28#1 <= 2147483647; {230#false} is VALID [2022-02-20 16:39:26,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#false} assume 0 == main_#t~ret28#1;havoc main_#t~ret28#1; {230#false} is VALID [2022-02-20 16:39:26,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-02-20 16:39:26,959 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:39:26,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:39:26,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982562240] [2022-02-20 16:39:26,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982562240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:26,960 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:26,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:39:26,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067041186] [2022-02-20 16:39:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:26,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:26,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:26,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:26,974 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:39:26,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:39:26,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:39:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:39:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:39:26,977 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:27,087 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2022-02-20 16:39:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:39:27,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 16:39:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 16:39:27,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-02-20 16:39:27,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:27,165 INFO L225 Difference]: With dead ends: 68 [2022-02-20 16:39:27,165 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 16:39:27,166 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:39:27,167 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 69 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:39:27,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 16:39:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2022-02-20 16:39:27,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:27,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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:39:27,172 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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:39:27,172 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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:39:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:27,175 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-02-20 16:39:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-02-20 16:39:27,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:27,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:27,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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 47 states. [2022-02-20 16:39:27,176 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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 47 states. [2022-02-20 16:39:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:27,178 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-02-20 16:39:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-02-20 16:39:27,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:27,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:27,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:27,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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:39:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-02-20 16:39:27,181 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 11 [2022-02-20 16:39:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:27,182 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-02-20 16:39:27,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-02-20 16:39:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:39:27,183 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:27,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:27,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:39:27,183 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:27,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1924506643, now seen corresponding path program 1 times [2022-02-20 16:39:27,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:27,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060943631] [2022-02-20 16:39:27,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:39:27,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:39:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:39:27,266 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:39:27,267 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:39:27,268 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:39:27,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:39:27,272 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:39:27,274 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:39:27,300 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:39:27,301 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:39:27,301 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:39:27,301 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:39:27,301 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:39:27,301 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:39:27,301 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:39:27,301 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L67-7 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L67-7 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:39:27,302 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:39:27,303 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:39:27,303 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-02-20 16:39:27,303 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:39:27,303 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:39:27,303 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:39:27,303 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:39:27,303 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:39:27,303 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L67-5 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L67-5 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L77-2 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:39:27,304 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:39:27,305 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:39:27,305 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 16:39:27,305 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 16:39:27,305 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:39:27,305 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:39:27,305 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:39:27,305 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:39:27,305 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 16:39:27,306 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 16:39:27,306 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:39:27,306 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 16:39:27,306 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 16:39:27,306 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:39:27,306 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:39:27,306 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:39:27,307 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 16:39:27,307 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:39:27,307 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:39:27,307 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-02-20 16:39:27,307 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 16:39:27,307 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 16:39:27,307 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 16:39:27,307 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 16:39:27,308 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:39:27,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:39:27 BoogieIcfgContainer [2022-02-20 16:39:27,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:39:27,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:39:27,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:39:27,310 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:39:27,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:26" (3/4) ... [2022-02-20 16:39:27,313 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:39:27,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:39:27,314 INFO L158 Benchmark]: Toolchain (without parser) took 1937.36ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 77.1MB in the end (delta: -405.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:27,314 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory was 48.2MB in the beginning and 48.2MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:27,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.43ms. Allocated memory is still 109.1MB. Free memory was 76.4MB in the beginning and 81.4MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:39:27,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.52ms. Allocated memory is still 109.1MB. Free memory was 81.4MB in the beginning and 78.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:27,315 INFO L158 Benchmark]: Boogie Preprocessor took 44.56ms. Allocated memory is still 109.1MB. Free memory was 78.7MB in the beginning and 76.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:27,316 INFO L158 Benchmark]: RCFGBuilder took 506.47ms. Allocated memory is still 109.1MB. Free memory was 76.3MB in the beginning and 58.9MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:39:27,316 INFO L158 Benchmark]: TraceAbstraction took 1060.40ms. Allocated memory is still 109.1MB. Free memory was 58.9MB in the beginning and 77.1MB in the end (delta: -18.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2022-02-20 16:39:27,317 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 109.1MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:27,319 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.17ms. Allocated memory is still 77.6MB. Free memory was 48.2MB in the beginning and 48.2MB in the end (delta: 24.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.43ms. Allocated memory is still 109.1MB. Free memory was 76.4MB in the beginning and 81.4MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.52ms. Allocated memory is still 109.1MB. Free memory was 81.4MB in the beginning and 78.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.56ms. Allocated memory is still 109.1MB. Free memory was 78.7MB in the beginning and 76.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 506.47ms. Allocated memory is still 109.1MB. Free memory was 76.3MB in the beginning and 58.9MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1060.40ms. Allocated memory is still 109.1MB. Free memory was 58.9MB in the beginning and 77.1MB in the end (delta: -18.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 109.1MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 134]: 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 17, overapproximation of someUnaryDOUBLEoperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 129. 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] [L129] float x = 0.0f / 0.0f; [L130] 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] [L130] RET, EXPR atan_float(x) [L130] float res = atan_float(x); [L133] CALL, EXPR isnan_float(res) [L17] return x != x; VAL [\old(x)=1000000000000000000000000000001, \result=0, 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] [L133] RET, EXPR isnan_float(res) [L133] COND TRUE !isnan_float(res) [L134] 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 90 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=36occurred 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, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 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:39:27,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0610.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 25249e4a5dfcdfed2078f190bfb36f4672db41bdb03e03d1de22de138ec215e0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:39:29,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:39:29,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:39:29,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:39:29,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:39:29,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:39:29,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:39:29,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:39:29,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:39:29,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:39:29,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:39:29,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:39:29,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:39:29,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:39:29,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:39:29,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:39:29,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:39:29,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:39:29,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:39:29,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:39:29,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:39:29,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:39:29,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:39:29,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:39:29,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:39:29,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:39:29,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:39:29,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:39:29,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:39:29,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:39:29,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:39:29,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:39:29,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:39:29,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:39:29,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:39:29,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:39:29,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:39:29,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:39:29,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:39:29,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:39:29,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:39:29,381 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:39:29,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:39:29,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:39:29,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:39:29,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:39:29,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:39:29,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:39:29,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:39:29,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:39:29,419 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:39:29,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:39:29,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:39:29,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:39:29,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:39:29,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:39:29,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:39:29,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:39:29,421 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:39:29,422 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:39:29,422 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:39:29,422 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:39:29,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:39:29,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:39:29,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:39:29,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:39:29,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:39:29,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:39:29,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:29,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:39:29,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:39:29,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:39:29,424 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:39:29,424 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:39:29,425 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:39:29,425 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:39:29,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:39:29,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:39:29,425 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 -> 25249e4a5dfcdfed2078f190bfb36f4672db41bdb03e03d1de22de138ec215e0 [2022-02-20 16:39:29,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:39:29,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:39:29,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:39:29,756 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:39:29,756 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:39:29,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0610.c [2022-02-20 16:39:29,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8bec166b/172ee0475b7644cbb99c6e3dde3a4320/FLAG3fa6c3a4a [2022-02-20 16:39:30,190 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:39:30,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0610.c [2022-02-20 16:39:30,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8bec166b/172ee0475b7644cbb99c6e3dde3a4320/FLAG3fa6c3a4a [2022-02-20 16:39:30,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8bec166b/172ee0475b7644cbb99c6e3dde3a4320 [2022-02-20 16:39:30,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:39:30,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:39:30,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:30,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:39:30,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:39:30,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee556cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30, skipping insertion in model container [2022-02-20 16:39:30,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:39:30,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:39:30,814 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_0610.c[3190,3203] [2022-02-20 16:39:30,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:30,847 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:39:30,893 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_0610.c[3190,3203] [2022-02-20 16:39:30,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:30,912 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:39:30,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30 WrapperNode [2022-02-20 16:39:30,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:30,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:30,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:39:30,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:39:30,919 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:39:30" (1/1) ... [2022-02-20 16:39:30,930 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:39:30" (1/1) ... [2022-02-20 16:39:30,963 INFO L137 Inliner]: procedures = 22, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-02-20 16:39:30,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:30,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:39:30,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:39:30,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:39:30,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:30,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:39:30,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:39:30,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:39:30,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:39:30,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (1/1) ... [2022-02-20 16:39:31,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:31,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:39:31,025 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:39:31,047 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:39:31,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:39:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:39:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:39:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:39:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:39:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:39:31,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:39:31,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:39:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:39:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:39:31,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:39:31,137 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:39:31,139 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:39:40,026 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:39:40,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:39:40,032 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:39:40,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:40 BoogieIcfgContainer [2022-02-20 16:39:40,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:39:40,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:39:40,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:39:40,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:39:40,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:39:30" (1/3) ... [2022-02-20 16:39:40,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cb1037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:40, skipping insertion in model container [2022-02-20 16:39:40,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:30" (2/3) ... [2022-02-20 16:39:40,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cb1037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:40, skipping insertion in model container [2022-02-20 16:39:40,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:40" (3/3) ... [2022-02-20 16:39:40,040 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0610.c [2022-02-20 16:39:40,044 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:39:40,044 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:39:40,080 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:39:40,086 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:39:40,086 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:39:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 32 states have internal predecessors, (50), 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:39:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:39:40,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:40,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:40,108 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1030411275, now seen corresponding path program 1 times [2022-02-20 16:39:40,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:39:40,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952485174] [2022-02-20 16:39:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:40,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:39:40,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:39:40,135 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:39:40,169 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:39:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:40,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:39:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:40,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:39:40,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~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)); {36#true} is VALID [2022-02-20 16:39:40,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret26#1, main_#t~ret27#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~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; {36#true} is VALID [2022-02-20 16:39:40,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-02-20 16:39:40,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {37#false} is VALID [2022-02-20 16:39:40,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume ~bvsge32(atan_float_~ix~1#1, 1350565888bv32); {37#false} is VALID [2022-02-20 16:39:40,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#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); {37#false} is VALID [2022-02-20 16:39:40,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#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;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {37#false} is VALID [2022-02-20 16:39:40,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} main_#t~ret27#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {37#false} is VALID [2022-02-20 16:39:40,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} assume 0bv32 == main_#t~ret27#1;havoc main_#t~ret27#1; {37#false} is VALID [2022-02-20 16:39:40,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:39:40,954 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:39:40,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:39:40,955 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:39:40,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952485174] [2022-02-20 16:39:40,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952485174] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:40,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:40,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:39:40,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492496365] [2022-02-20 16:39:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:40,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:40,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:40,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:40,997 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:39:40,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:39:40,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:39:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:39:41,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:41,023 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 32 states have internal predecessors, (50), 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 5.0) internal successors, (10), 2 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:39:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:52,009 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2022-02-20 16:39:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:39:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2022-02-20 16:39:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2022-02-20 16:39:52,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2022-02-20 16:39:54,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:54,455 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:39:54,455 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:39:54,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:39:54,461 INFO L933 BasicCegarLoop]: 43 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, 43 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:39:54,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:39:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:39:54,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:54,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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:39:54,484 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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:39:54,485 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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:39:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:54,488 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 16:39:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:39:54,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:54,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:54,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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 30 states. [2022-02-20 16:39:54,489 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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 30 states. [2022-02-20 16:39:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:54,492 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 16:39:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:39:54,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:54,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:54,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:54,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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:39:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-02-20 16:39:54,496 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 10 [2022-02-20 16:39:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:54,496 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-20 16:39:54,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:39:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:39:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:39:54,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:54,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:54,527 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:39:54,711 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:39:54,712 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1304895922, now seen corresponding path program 1 times [2022-02-20 16:39:54,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:39:54,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968425068] [2022-02-20 16:39:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:54,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:39:54,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:39:54,715 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:39:54,717 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:39:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:55,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:39:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:55,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:39:56,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {238#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~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)); {243#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:39:56,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret26#1, main_#t~ret27#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~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; {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:39:56,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} 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; {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:39:56,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:39:56,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:39:56,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsge32(atan_float_~ix~1#1, 1350565888bv32); {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:39:56,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {247#(and (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsgt32(atan_float_~ix~1#1, 2139095040bv32);atan_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, atan_float_~x#1, atan_float_~x#1); {263#(= |ULTIMATE.start_atan_float_#res#1| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:39:56,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= |ULTIMATE.start_atan_float_#res#1| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))))} 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;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {267#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:39:56,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret27#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {271#(= |ULTIMATE.start_main_#t~ret27#1| (_ bv1 32))} is VALID [2022-02-20 16:39:56,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(= |ULTIMATE.start_main_#t~ret27#1| (_ bv1 32))} assume 0bv32 == main_#t~ret27#1;havoc main_#t~ret27#1; {239#false} is VALID [2022-02-20 16:39:56,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-02-20 16:39:56,171 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:39:56,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:39:56,171 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:39:56,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968425068] [2022-02-20 16:39:56,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968425068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:56,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:56,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:39:56,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172844391] [2022-02-20 16:39:56,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:56,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:39:56,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:56,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:39:56,208 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:39:56,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:39:56,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:39:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:39:56,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:39:56,210 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:00,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:07,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:09,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:18,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:20,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:22,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:25,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:32,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:35,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:37,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:37,886 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-02-20 16:40:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:40:37,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:37,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-02-20 16:40:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-02-20 16:40:37,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-02-20 16:40:40,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:40,124 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:40:40,124 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:40:40,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:40:40,125 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:40,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 114 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 22.8s Time] [2022-02-20 16:40:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:40:40,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-02-20 16:40:40,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:40,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:40:40,129 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:40:40,129 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:40:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:40,131 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-02-20 16:40:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-02-20 16:40:40,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:40,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:40,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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 37 states. [2022-02-20 16:40:40,133 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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 37 states. [2022-02-20 16:40:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:40,135 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-02-20 16:40:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-02-20 16:40:40,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:40,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:40,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:40,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:40:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-02-20 16:40:40,137 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 11 [2022-02-20 16:40:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:40,138 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-02-20 16:40:40,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 16:40:40,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:40:40,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:40,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:40,172 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:40:40,355 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:40:40,356 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1812830160, now seen corresponding path program 1 times [2022-02-20 16:40:40,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:40,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982452336] [2022-02-20 16:40:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:40,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:40,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:40,358 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:40:40,360 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:40:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:41,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:40:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:41,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:41,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {448#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~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)); {448#true} is VALID [2022-02-20 16:40:41,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {448#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret26#1, main_#t~ret27#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~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; {456#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:40:41,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_atan_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} 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; {460#(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 (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:40:41,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#(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 (_ +zero 8 24) (_ +zero 8 24))))} goto; {460#(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 (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:40:41,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {460#(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 (_ +zero 8 24) (_ +zero 8 24))))} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {467#(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 (_ +zero 8 24) (_ +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:41,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#(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 (_ +zero 8 24) (_ +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); {467#(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 (_ +zero 8 24) (_ +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:41,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#(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 (_ +zero 8 24) (_ +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); {449#false} is VALID [2022-02-20 16:40:41,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {449#false} 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; {449#false} is VALID [2022-02-20 16:40:41,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#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;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {449#false} is VALID [2022-02-20 16:40:41,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {449#false} main_#t~ret27#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {449#false} is VALID [2022-02-20 16:40:41,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {449#false} assume 0bv32 == main_#t~ret27#1;havoc main_#t~ret27#1; {449#false} is VALID [2022-02-20 16:40:41,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {449#false} assume !false; {449#false} is VALID [2022-02-20 16:40:41,645 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:41,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:41,646 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:41,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982452336] [2022-02-20 16:40:41,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982452336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:41,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:41,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:40:41,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584461451] [2022-02-20 16:40:41,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:41,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 16:40:41,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:41,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:41,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:41,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:40:41,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:41,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:40:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:40:41,681 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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)