./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0921.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/double_req_bl_0921.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 ff79c740204f513a01c900350576ff8bf7bfaa86497cf43ba5460bcbb774895a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:35:12,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:35:12,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:35:12,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:35:12,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:35:12,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:35:12,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:35:12,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:35:12,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:35:12,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:35:12,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:35:12,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:35:12,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:35:12,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:35:12,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:35:12,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:35:12,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:35:12,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:35:12,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:35:12,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:35:12,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:35:12,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:35:12,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:35:12,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:35:12,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:35:12,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:35:12,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:35:12,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:35:12,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:35:12,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:35:12,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:35:12,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:35:12,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:35:12,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:35:12,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:35:12,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:35:12,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:35:12,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:35:12,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:35:12,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:35:12,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:35:12,620 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:35:12,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:35:12,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:35:12,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:35:12,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:35:12,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:35:12,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:35:12,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:35:12,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:35:12,649 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:35:12,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:35:12,650 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:35:12,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:35:12,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:35:12,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:35:12,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:35:12,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:35:12,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:35:12,651 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:35:12,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:35:12,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:35:12,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:35:12,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:35:12,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:35:12,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:35:12,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:12,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:35:12,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:35:12,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:35:12,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:35:12,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:35:12,653 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:35:12,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:35:12,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:35:12,653 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 -> ff79c740204f513a01c900350576ff8bf7bfaa86497cf43ba5460bcbb774895a [2022-02-20 16:35:12,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:35:12,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:35:12,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:35:12,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:35:12,858 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:35:12,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0921.c [2022-02-20 16:35:12,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cfd47fd/0161032eb35d4cfcaeab9c0b040361ee/FLAG4aaf34277 [2022-02-20 16:35:13,291 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:35:13,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0921.c [2022-02-20 16:35:13,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cfd47fd/0161032eb35d4cfcaeab9c0b040361ee/FLAG4aaf34277 [2022-02-20 16:35:13,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cfd47fd/0161032eb35d4cfcaeab9c0b040361ee [2022-02-20 16:35:13,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:35:13,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:35:13,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:13,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:35:13,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:35:13,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d48759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13, skipping insertion in model container [2022-02-20 16:35:13,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:35:13,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:35:13,463 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/double_req_bl_0921.c[3679,3692] [2022-02-20 16:35:13,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:13,470 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:35:13,514 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/double_req_bl_0921.c[3679,3692] [2022-02-20 16:35:13,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:13,524 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:35:13,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13 WrapperNode [2022-02-20 16:35:13,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:13,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:13,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:35:13,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:35:13,530 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:35:13" (1/1) ... [2022-02-20 16:35:13,536 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:35:13" (1/1) ... [2022-02-20 16:35:13,577 INFO L137 Inliner]: procedures = 18, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 157 [2022-02-20 16:35:13,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:13,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:35:13,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:35:13,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:35:13,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:35:13,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:35:13,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:35:13,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:35:13,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (1/1) ... [2022-02-20 16:35:13,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:13,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:35:13,668 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:35:13,711 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:35:13,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:35:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:35:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:35:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:35:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:35:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:35:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:35:13,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:35:13,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:35:13,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:35:13,805 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:35:13,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:35:14,151 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:35:14,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:35:14,157 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:35:14,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:14 BoogieIcfgContainer [2022-02-20 16:35:14,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:35:14,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:35:14,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:35:14,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:35:14,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:35:13" (1/3) ... [2022-02-20 16:35:14,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b36b36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:14, skipping insertion in model container [2022-02-20 16:35:14,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:13" (2/3) ... [2022-02-20 16:35:14,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b36b36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:14, skipping insertion in model container [2022-02-20 16:35:14,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:14" (3/3) ... [2022-02-20 16:35:14,165 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0921.c [2022-02-20 16:35:14,169 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:35:14,170 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:35:14,206 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:35:14,216 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:35:14,216 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:35:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 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:35:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:35:14,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:14,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:14,234 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:14,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1030811467, now seen corresponding path program 1 times [2022-02-20 16:35:14,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:35:14,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143585766] [2022-02-20 16:35:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:35:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:14,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~ln2_hi_log~0 := 0.6931471803691238;~ln2_lo_log~0 := 1.9082149292705877E-10;~two54_log~0 := 1.8014398509481984E16;~Lg1_log~0 := 0.6666666666666735;~Lg2_log~0 := 0.3999999999940942;~Lg3_log~0 := 0.2857142874366239;~Lg4_log~0 := 0.22222198432149784;~Lg5_log~0 := 0.1818357216161805;~Lg6_log~0 := 0.15313837699209373;~Lg7_log~0 := 0.14798198605116586;~zero~0 := 0.0; {36#true} is VALID [2022-02-20 16:35:14,371 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~ret11#1, main_#t~ret12#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline___ieee754_log } true;__ieee754_log_#in~x#1 := main_~x~0#1;havoc __ieee754_log_#res#1;havoc __ieee754_log_#t~mem6#1, __ieee754_log_#t~mem7#1, __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, __ieee754_log_#t~mem8#1, __ieee754_log_~#gh_u~0#1.base, __ieee754_log_~#gh_u~0#1.offset, __ieee754_log_#t~mem10#1, __ieee754_log_~#sh_u~0#1.base, __ieee754_log_~#sh_u~0#1.offset, __ieee754_log_~x#1, __ieee754_log_~hfsq~0#1, __ieee754_log_~f~0#1, __ieee754_log_~s~0#1, __ieee754_log_~z~0#1, __ieee754_log_~R~0#1, __ieee754_log_~w~0#1, __ieee754_log_~t1~0#1, __ieee754_log_~t2~0#1, __ieee754_log_~dk~0#1, __ieee754_log_~k~0#1, __ieee754_log_~hx~1#1, __ieee754_log_~i~0#1, __ieee754_log_~j~0#1, __ieee754_log_~lx~1#1, __ieee754_log_#t~nondet9#1;__ieee754_log_~x#1 := __ieee754_log_#in~x#1;havoc __ieee754_log_~hfsq~0#1;havoc __ieee754_log_~f~0#1;havoc __ieee754_log_~s~0#1;havoc __ieee754_log_~z~0#1;havoc __ieee754_log_~R~0#1;havoc __ieee754_log_~w~0#1;havoc __ieee754_log_~t1~0#1;havoc __ieee754_log_~t2~0#1;havoc __ieee754_log_~dk~0#1;havoc __ieee754_log_~k~0#1;havoc __ieee754_log_~hx~1#1;havoc __ieee754_log_~i~0#1;havoc __ieee754_log_~j~0#1;havoc __ieee754_log_~lx~1#1; {36#true} is VALID [2022-02-20 16:35:14,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-02-20 16:35:14,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} __ieee754_log_~k~0#1 := 0; {37#false} is VALID [2022-02-20 16:35:14,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume __ieee754_log_~hx~1#1 < 1048576; {37#false} is VALID [2022-02-20 16:35:14,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} assume 0 == (if (1 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) || 0 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647)))) && 0 == __ieee754_log_~lx~1#1 then (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) else (if 0 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) && (1 == __ieee754_log_~lx~1#1 || 0 == __ieee754_log_~lx~1#1) then __ieee754_log_~lx~1#1 else (if (1 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) && (1 == __ieee754_log_~lx~1#1 || 0 == __ieee754_log_~lx~1#1)) || ((1 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) || 0 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647)))) && 1 == __ieee754_log_~lx~1#1) then 1 else ~bitwiseOr((if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))), __ieee754_log_~lx~1#1)))) % 4294967296;__ieee754_log_#res#1 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(~two54_log~0), ~zero~0); {37#false} is VALID [2022-02-20 16:35:14,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#false} main_#t~ret11#1 := __ieee754_log_#res#1;assume { :end_inline___ieee754_log } true;main_~res~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {37#false} is VALID [2022-02-20 16:35:14,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} main_#t~ret12#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {37#false} is VALID [2022-02-20 16:35:14,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} assume 0 == main_#t~ret12#1;havoc main_#t~ret12#1; {37#false} is VALID [2022-02-20 16:35:14,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:35:14,374 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:35:14,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:35:14,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143585766] [2022-02-20 16:35:14,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143585766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:35:14,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:35:14,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:35:14,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397170795] [2022-02-20 16:35:14,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:35:14,385 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:35:14,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:35:14,388 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:35:14,407 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:35:14,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:35:14,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:35:14,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:35:14,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:35:14,429 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 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:35:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:14,487 INFO L93 Difference]: Finished difference Result 64 states and 106 transitions. [2022-02-20 16:35:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:35:14,487 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:35:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:35:14,488 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:35:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2022-02-20 16:35:14,507 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:35:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2022-02-20 16:35:14,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 106 transitions. [2022-02-20 16:35:14,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:35:14,624 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:35:14,624 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:35:14,627 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:35:14,629 INFO L933 BasicCegarLoop]: 45 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, 45 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:35:14,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:35:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:35:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:35:14,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:35:14,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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:35:14,653 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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:35:14,654 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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:35:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:14,657 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2022-02-20 16:35:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-02-20 16:35:14,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:35:14,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:35:14,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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:35:14,658 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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:35:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:14,661 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2022-02-20 16:35:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-02-20 16:35:14,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:35:14,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:35:14,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:35:14,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:35:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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:35:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-02-20 16:35:14,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 10 [2022-02-20 16:35:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:35:14,666 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2022-02-20 16:35:14,666 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:35:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2022-02-20 16:35:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:35:14,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:14,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:14,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:35:14,670 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:14,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1304495730, now seen corresponding path program 1 times [2022-02-20 16:35:14,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:35:14,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369913134] [2022-02-20 16:35:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:35:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:35:14,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:35:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:35:14,794 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:35:14,798 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:35:14,800 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:35:14,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:35:14,803 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:35:14,805 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:35:14,836 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:35:14,836 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:35:14,836 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:35:14,836 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:35:14,836 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:35:14,837 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L67-2 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L67-2 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:35:14,838 WARN L170 areAnnotationChecker]: L77-2 has no Hoare annotation [2022-02-20 16:35:14,839 WARN L170 areAnnotationChecker]: L77-2 has no Hoare annotation [2022-02-20 16:35:14,839 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-02-20 16:35:14,839 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-02-20 16:35:14,839 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:35:14,839 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:35:14,839 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:35:14,839 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:35:14,839 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L77-4 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L77-4 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L77-6 has no Hoare annotation [2022-02-20 16:35:14,840 WARN L170 areAnnotationChecker]: L77-6 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:35:14,841 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 16:35:14,842 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 16:35:14,842 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:35:14,842 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:35:14,842 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:35:14,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:35:14 BoogieIcfgContainer [2022-02-20 16:35:14,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:35:14,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:35:14,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:35:14,844 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:35:14,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:14" (3/4) ... [2022-02-20 16:35:14,846 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:35:14,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:35:14,848 INFO L158 Benchmark]: Toolchain (without parser) took 1533.34ms. Allocated memory is still 115.3MB. Free memory was 72.5MB in the beginning and 67.8MB in the end (delta: 4.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-02-20 16:35:14,848 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:35:14,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.89ms. Allocated memory is still 115.3MB. Free memory was 72.3MB in the beginning and 93.3MB in the end (delta: -21.1MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-02-20 16:35:14,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.03ms. Allocated memory is still 115.3MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:35:14,852 INFO L158 Benchmark]: Boogie Preprocessor took 46.97ms. Allocated memory is still 115.3MB. Free memory was 90.4MB in the beginning and 88.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:35:14,854 INFO L158 Benchmark]: RCFGBuilder took 530.22ms. Allocated memory is still 115.3MB. Free memory was 88.3MB in the beginning and 78.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:35:14,854 INFO L158 Benchmark]: TraceAbstraction took 684.38ms. Allocated memory is still 115.3MB. Free memory was 77.5MB in the beginning and 68.3MB in the end (delta: 9.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-02-20 16:35:14,854 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 115.3MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:35:14,859 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.89ms. Allocated memory is still 115.3MB. Free memory was 72.3MB in the beginning and 93.3MB in the end (delta: -21.1MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.03ms. Allocated memory is still 115.3MB. Free memory was 93.3MB in the beginning and 90.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.97ms. Allocated memory is still 115.3MB. Free memory was 90.4MB in the beginning and 88.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 530.22ms. Allocated memory is still 115.3MB. Free memory was 88.3MB in the beginning and 78.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 684.38ms. Allocated memory is still 115.3MB. Free memory was 77.5MB in the beginning and 68.3MB in the end (delta: 9.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 115.3MB. Free memory is still 68.3MB. 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: 142]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 61, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62, overapproximation of bitwiseAnd at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L34-L43] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L45] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L137] double x = 0.0 / 0.0; [L138] CALL, EXPR __ieee754_log(x) [L48] double hfsq, f, s, z, R, w, t1, t2, dk; [L49] __int32_t k, hx, i, j; [L50] __uint32_t lx; VAL [\old(x)=18014398509481986, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481986, zero=0] [L53] ieee_double_shape_type ew_u; [L54] ew_u.value = (x) [L55] EXPR ew_u.parts.msw [L55] (hx) = ew_u.parts.msw [L56] EXPR ew_u.parts.lsw [L56] (lx) = ew_u.parts.lsw [L59] k = 0 VAL [\old(x)=18014398509481986, hx=6, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=18014398509481986, zero=0] [L60] COND TRUE hx < 0x00100000 VAL [\old(x)=18014398509481986, hx=6, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=18014398509481986, zero=0] [L61] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L62] return -two54_log / zero; VAL [\old(x)=18014398509481986, hx=6, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=18014398509481986, zero=0] [L138] RET, EXPR __ieee754_log(x) [L138] double res = __ieee754_log(x); [L141] CALL, EXPR isnan_double(res) [L129] return x != x; VAL [\old(x)=18014398509481985, \result=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481985, zero=0] [L141] RET, EXPR isnan_double(res) [L141] COND TRUE !isnan_double(res) [L142] reach_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, res=18014398509481985, two54_log=18014398509481984, x=18014398509481986, zero=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:35:14,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0921.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 ff79c740204f513a01c900350576ff8bf7bfaa86497cf43ba5460bcbb774895a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:35:16,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:35:16,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:35:16,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:35:16,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:35:16,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:35:16,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:35:16,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:35:16,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:35:16,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:35:16,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:35:16,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:35:16,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:35:16,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:35:16,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:35:16,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:35:16,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:35:16,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:35:16,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:35:16,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:35:16,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:35:16,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:35:16,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:35:16,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:35:16,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:35:16,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:35:16,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:35:16,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:35:16,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:35:16,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:35:16,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:35:16,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:35:16,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:35:16,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:35:16,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:35:16,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:35:16,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:35:16,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:35:16,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:35:16,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:35:16,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:35:16,496 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:35:16,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:35:16,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:35:16,528 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:35:16,528 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:35:16,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:35:16,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:35:16,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:35:16,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:35:16,530 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:35:16,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:35:16,531 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:35:16,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:35:16,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:35:16,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:35:16,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:35:16,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:35:16,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:35:16,532 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:35:16,532 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:35:16,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:35:16,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:35:16,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:35:16,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:35:16,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:35:16,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:35:16,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:35:16,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:16,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:35:16,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:35:16,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:35:16,538 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:35:16,538 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:35:16,538 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:35:16,538 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:35:16,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:35:16,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:35:16,539 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 -> ff79c740204f513a01c900350576ff8bf7bfaa86497cf43ba5460bcbb774895a [2022-02-20 16:35:16,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:35:16,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:35:16,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:35:16,813 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:35:16,813 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:35:16,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0921.c [2022-02-20 16:35:16,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261574478/a6f19830021e4476a60d506358971e12/FLAGd12721b10 [2022-02-20 16:35:17,248 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:35:17,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0921.c [2022-02-20 16:35:17,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261574478/a6f19830021e4476a60d506358971e12/FLAGd12721b10 [2022-02-20 16:35:17,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/261574478/a6f19830021e4476a60d506358971e12 [2022-02-20 16:35:17,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:35:17,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:35:17,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:17,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:35:17,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:35:17,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a646410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17, skipping insertion in model container [2022-02-20 16:35:17,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:35:17,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:35:17,490 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/double_req_bl_0921.c[3679,3692] [2022-02-20 16:35:17,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:17,504 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:35:17,544 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/double_req_bl_0921.c[3679,3692] [2022-02-20 16:35:17,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:17,561 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:35:17,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17 WrapperNode [2022-02-20 16:35:17,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:17,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:17,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:35:17,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:35:17,567 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:35:17" (1/1) ... [2022-02-20 16:35:17,586 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:35:17" (1/1) ... [2022-02-20 16:35:17,616 INFO L137 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2022-02-20 16:35:17,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:17,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:35:17,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:35:17,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:35:17,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:35:17,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:35:17,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:35:17,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:35:17,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:17,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:35:17,708 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:35:17,713 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:35:17,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:35:17,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:35:17,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:35:17,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:35:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:35:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:35:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:35:17,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:35:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:35:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:35:17,805 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:35:17,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:35:41,976 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:35:41,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:35:41,981 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:35:41,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:41 BoogieIcfgContainer [2022-02-20 16:35:41,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:35:41,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:35:41,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:35:41,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:35:41,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:35:17" (1/3) ... [2022-02-20 16:35:41,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7c0d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:41, skipping insertion in model container [2022-02-20 16:35:41,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17" (2/3) ... [2022-02-20 16:35:41,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7c0d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:41, skipping insertion in model container [2022-02-20 16:35:41,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:41" (3/3) ... [2022-02-20 16:35:41,988 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0921.c [2022-02-20 16:35:41,991 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:35:41,991 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:35:42,024 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:35:42,029 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:35:42,029 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:35:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 28 states have internal predecessors, (46), 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:35:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:35:42,043 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:42,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:42,044 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1030195787, now seen corresponding path program 1 times [2022-02-20 16:35:42,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:35:42,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438181596] [2022-02-20 16:35:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:42,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:35:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:35:42,064 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:35:42,065 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:35:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:42,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:35:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:42,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:35:43,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ln2_hi_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238);~ln2_lo_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10);~two54_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.8014398509481984E16);~Lg1_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6666666666666735);~Lg2_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.3999999999940942);~Lg3_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.2857142874366239);~Lg4_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.22222198432149784);~Lg5_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.1818357216161805);~Lg6_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.15313837699209373);~Lg7_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.14798198605116586);~zero~0 := ~Pluszero~DOUBLE(); {32#true} is VALID [2022-02-20 16:35:43,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1, main_#t~ret11#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_log } true;__ieee754_log_#in~x#1 := main_~x~0#1;havoc __ieee754_log_#res#1;havoc __ieee754_log_#t~mem6#1, __ieee754_log_#t~mem7#1, __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, __ieee754_log_#t~mem8#1, __ieee754_log_~#gh_u~0#1.base, __ieee754_log_~#gh_u~0#1.offset, __ieee754_log_#t~mem9#1, __ieee754_log_~#sh_u~0#1.base, __ieee754_log_~#sh_u~0#1.offset, __ieee754_log_~x#1, __ieee754_log_~hfsq~0#1, __ieee754_log_~f~0#1, __ieee754_log_~s~0#1, __ieee754_log_~z~0#1, __ieee754_log_~R~0#1, __ieee754_log_~w~0#1, __ieee754_log_~t1~0#1, __ieee754_log_~t2~0#1, __ieee754_log_~dk~0#1, __ieee754_log_~k~0#1, __ieee754_log_~hx~1#1, __ieee754_log_~i~0#1, __ieee754_log_~j~0#1, __ieee754_log_~lx~1#1;__ieee754_log_~x#1 := __ieee754_log_#in~x#1;havoc __ieee754_log_~hfsq~0#1;havoc __ieee754_log_~f~0#1;havoc __ieee754_log_~s~0#1;havoc __ieee754_log_~z~0#1;havoc __ieee754_log_~R~0#1;havoc __ieee754_log_~w~0#1;havoc __ieee754_log_~t1~0#1;havoc __ieee754_log_~t2~0#1;havoc __ieee754_log_~dk~0#1;havoc __ieee754_log_~k~0#1;havoc __ieee754_log_~hx~1#1;havoc __ieee754_log_~i~0#1;havoc __ieee754_log_~j~0#1;havoc __ieee754_log_~lx~1#1; {32#true} is VALID [2022-02-20 16:35:43,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume !true; {33#false} is VALID [2022-02-20 16:35:43,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#false} __ieee754_log_~k~0#1 := 0bv32; {33#false} is VALID [2022-02-20 16:35:43,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#false} assume ~bvslt32(__ieee754_log_~hx~1#1, 1048576bv32); {33#false} is VALID [2022-02-20 16:35:43,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume 0bv32 == ~bvor32(~bvand32(2147483647bv32, __ieee754_log_~hx~1#1), __ieee754_log_~lx~1#1);__ieee754_log_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~two54_log~0), ~zero~0); {33#false} is VALID [2022-02-20 16:35:43,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#false} main_#t~ret10#1 := __ieee754_log_#res#1;assume { :end_inline___ieee754_log } true;main_~res~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {33#false} is VALID [2022-02-20 16:35:43,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} main_#t~ret11#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {33#false} is VALID [2022-02-20 16:35:43,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume 0bv32 == main_#t~ret11#1;havoc main_#t~ret11#1; {33#false} is VALID [2022-02-20 16:35:43,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 16:35:43,019 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:35:43,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:35:43,020 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:35:43,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438181596] [2022-02-20 16:35:43,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438181596] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:35:43,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:35:43,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:35:43,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389909651] [2022-02-20 16:35:43,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:35:43,027 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:35:43,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:35:43,030 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:35:43,798 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:35:43,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:35:43,799 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:35:43,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:35:43,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:35:43,815 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 28 states have internal predecessors, (46), 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:36:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:07,391 INFO L93 Difference]: Finished difference Result 56 states and 90 transitions. [2022-02-20 16:36:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:36:07,391 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:36:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:07,392 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:36:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:36:07,397 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:36:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2022-02-20 16:36:07,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions. [2022-02-20 16:36:19,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:19,912 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:36:19,912 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:36:19,914 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:36:19,917 INFO L933 BasicCegarLoop]: 39 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, 39 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:36:19,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:36:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:36:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:36:19,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:19,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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:36:19,935 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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:36:19,936 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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:36:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:19,938 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2022-02-20 16:36:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-02-20 16:36:19,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:19,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:19,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 26 states. [2022-02-20 16:36:19,939 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 26 states. [2022-02-20 16:36:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:19,941 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2022-02-20 16:36:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-02-20 16:36:19,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:19,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:19,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:19,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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:36:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-02-20 16:36:19,945 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 10 [2022-02-20 16:36:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:19,945 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-02-20 16:36:19,945 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:36:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-02-20 16:36:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:36:19,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:19,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:19,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:36:20,163 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:36:20,164 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:20,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1305111410, now seen corresponding path program 1 times [2022-02-20 16:36:20,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:20,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460500619] [2022-02-20 16:36:20,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:20,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:20,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:20,168 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:36:20,169 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:36:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:20,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:36:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:20,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:22,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~ln2_hi_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238);~ln2_lo_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10);~two54_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.8014398509481984E16);~Lg1_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6666666666666735);~Lg2_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.3999999999940942);~Lg3_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.2857142874366239);~Lg4_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.22222198432149784);~Lg5_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.1818357216161805);~Lg6_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.15313837699209373);~Lg7_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.14798198605116586);~zero~0 := ~Pluszero~DOUBLE(); {214#true} is VALID [2022-02-20 16:36:22,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1, main_#t~ret11#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_log } true;__ieee754_log_#in~x#1 := main_~x~0#1;havoc __ieee754_log_#res#1;havoc __ieee754_log_#t~mem6#1, __ieee754_log_#t~mem7#1, __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, __ieee754_log_#t~mem8#1, __ieee754_log_~#gh_u~0#1.base, __ieee754_log_~#gh_u~0#1.offset, __ieee754_log_#t~mem9#1, __ieee754_log_~#sh_u~0#1.base, __ieee754_log_~#sh_u~0#1.offset, __ieee754_log_~x#1, __ieee754_log_~hfsq~0#1, __ieee754_log_~f~0#1, __ieee754_log_~s~0#1, __ieee754_log_~z~0#1, __ieee754_log_~R~0#1, __ieee754_log_~w~0#1, __ieee754_log_~t1~0#1, __ieee754_log_~t2~0#1, __ieee754_log_~dk~0#1, __ieee754_log_~k~0#1, __ieee754_log_~hx~1#1, __ieee754_log_~i~0#1, __ieee754_log_~j~0#1, __ieee754_log_~lx~1#1;__ieee754_log_~x#1 := __ieee754_log_#in~x#1;havoc __ieee754_log_~hfsq~0#1;havoc __ieee754_log_~f~0#1;havoc __ieee754_log_~s~0#1;havoc __ieee754_log_~z~0#1;havoc __ieee754_log_~R~0#1;havoc __ieee754_log_~w~0#1;havoc __ieee754_log_~t1~0#1;havoc __ieee754_log_~t2~0#1;havoc __ieee754_log_~dk~0#1;havoc __ieee754_log_~k~0#1;havoc __ieee754_log_~hx~1#1;havoc __ieee754_log_~i~0#1;havoc __ieee754_log_~j~0#1;havoc __ieee754_log_~lx~1#1; {222#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_log_~x#1|))} is VALID [2022-02-20 16:36:22,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_log_~x#1|))} call __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__ieee754_log_~x#1, __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, 8bv32);call __ieee754_log_#t~mem6#1 := read~intINTTYPE4(__ieee754_log_~#ew_u~1#1.base, ~bvadd32(4bv32, __ieee754_log_~#ew_u~1#1.offset), 4bv32);__ieee754_log_~hx~1#1 := __ieee754_log_#t~mem6#1;havoc __ieee754_log_#t~mem6#1;call __ieee754_log_#t~mem7#1 := read~intINTTYPE4(__ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, 4bv32);__ieee754_log_~lx~1#1 := __ieee754_log_#t~mem7#1;havoc __ieee754_log_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset);havoc __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset; {226#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} is VALID [2022-02-20 16:36:22,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {226#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} goto; {226#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} is VALID [2022-02-20 16:36:22,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {226#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} __ieee754_log_~k~0#1 := 0bv32; {226#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} is VALID [2022-02-20 16:36:22,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} assume ~bvslt32(__ieee754_log_~hx~1#1, 1048576bv32); {226#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} is VALID [2022-02-20 16:36:23,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} assume 0bv32 == ~bvor32(~bvand32(2147483647bv32, __ieee754_log_~hx~1#1), __ieee754_log_~lx~1#1);__ieee754_log_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~two54_log~0), ~zero~0); {215#false} is VALID [2022-02-20 16:36:23,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {215#false} main_#t~ret10#1 := __ieee754_log_#res#1;assume { :end_inline___ieee754_log } true;main_~res~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {215#false} is VALID [2022-02-20 16:36:23,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#false} main_#t~ret11#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {215#false} is VALID [2022-02-20 16:36:23,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {215#false} assume 0bv32 == main_#t~ret11#1;havoc main_#t~ret11#1; {215#false} is VALID [2022-02-20 16:36:23,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {215#false} assume !false; {215#false} is VALID [2022-02-20 16:36:23,196 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:36:23,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:23,196 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:23,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460500619] [2022-02-20 16:36:23,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460500619] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:23,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:23,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:36:23,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858649490] [2022-02-20 16:36:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:23,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:36:23,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:23,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:36:23,997 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:36:23,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:36:23,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:36:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:36:23,998 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)