./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0834.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_0834.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 128b4841c61be319288af708e8567b4a053d8431485e24fb8ee12b4e2218f817 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:33:48,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:33:48,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:33:49,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:33:49,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:33:49,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:33:49,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:33:49,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:33:49,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:33:49,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:33:49,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:33:49,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:33:49,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:33:49,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:33:49,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:33:49,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:33:49,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:33:49,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:33:49,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:33:49,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:33:49,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:33:49,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:33:49,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:33:49,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:33:49,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:33:49,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:33:49,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:33:49,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:33:49,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:33:49,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:33:49,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:33:49,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:33:49,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:33:49,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:33:49,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:33:49,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:33:49,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:33:49,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:33:49,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:33:49,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:33:49,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:33:49,027 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:33:49,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:33:49,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:33:49,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:33:49,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:33:49,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:33:49,042 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:33:49,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:33:49,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:33:49,043 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:33:49,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:33:49,044 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:33:49,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:33:49,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:33:49,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:33:49,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:33:49,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:33:49,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:33:49,045 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:33:49,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:33:49,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:33:49,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:33:49,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:33:49,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:33:49,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:33:49,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:49,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:33:49,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:33:49,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:33:49,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:33:49,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:33:49,047 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:33:49,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:33:49,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:33:49,048 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 -> 128b4841c61be319288af708e8567b4a053d8431485e24fb8ee12b4e2218f817 [2022-02-20 16:33:49,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:33:49,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:33:49,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:33:49,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:33:49,252 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:33:49,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0834.c [2022-02-20 16:33:49,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec60bc45/488946072dd34001a0a8ebcb252a6ea2/FLAGed15dab36 [2022-02-20 16:33:49,683 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:33:49,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0834.c [2022-02-20 16:33:49,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec60bc45/488946072dd34001a0a8ebcb252a6ea2/FLAGed15dab36 [2022-02-20 16:33:49,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec60bc45/488946072dd34001a0a8ebcb252a6ea2 [2022-02-20 16:33:49,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:33:49,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:33:49,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:49,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:33:49,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:33:49,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:49,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f0cb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49, skipping insertion in model container [2022-02-20 16:33:49,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:49,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:33:49,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:33:49,911 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_0834.c[4256,4269] [2022-02-20 16:33:49,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:49,918 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:33:49,940 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_0834.c[4256,4269] [2022-02-20 16:33:49,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:49,960 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:33:49,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49 WrapperNode [2022-02-20 16:33:49,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:49,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:49,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:33:49,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:33:49,967 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:33:49" (1/1) ... [2022-02-20 16:33:49,983 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:33:49" (1/1) ... [2022-02-20 16:33:50,044 INFO L137 Inliner]: procedures = 18, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 215 [2022-02-20 16:33:50,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:50,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:33:50,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:33:50,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:33:50,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:50,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:50,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:50,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:50,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:50,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:50,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:50,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:33:50,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:33:50,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:33:50,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:33:50,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (1/1) ... [2022-02-20 16:33:50,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:50,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:33:50,120 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:33:50,134 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:33:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:33:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:33:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:33:50,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:33:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:33:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:33:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:33:50,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:33:50,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:33:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:33:50,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:33:50,254 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:33:50,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:33:50,650 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:33:50,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:33:50,655 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:33:50,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:50 BoogieIcfgContainer [2022-02-20 16:33:50,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:33:50,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:33:50,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:33:50,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:33:50,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:33:49" (1/3) ... [2022-02-20 16:33:50,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ea5807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:50, skipping insertion in model container [2022-02-20 16:33:50,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:49" (2/3) ... [2022-02-20 16:33:50,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ea5807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:50, skipping insertion in model container [2022-02-20 16:33:50,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:50" (3/3) ... [2022-02-20 16:33:50,666 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0834.c [2022-02-20 16:33:50,670 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:33:50,670 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:33:50,711 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:33:50,715 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:33:50,716 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:33:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.711111111111111) internal successors, (77), 46 states have internal predecessors, (77), 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:33:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:33:50,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:50,731 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:50,731 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:50,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash -703245445, now seen corresponding path program 1 times [2022-02-20 16:33:50,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:33:50,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438732709] [2022-02-20 16:33:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:50,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:33:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:50,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#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);~one_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(16, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 8);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 8 + ~#halF_exp~0.offset, 8);~huge_exp~0 := 1.0E300;~twom1000_exp~0 := 9.332636185032189E-302;~o_threshold_exp~0 := 709.782712893384;~u_threshold_exp~0 := ~someUnaryDOUBLEoperation(745.1332191019411);~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~real(0.6931471803691238, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 8);call write~init~real(~someUnaryDOUBLEoperation(0.6931471803691238), ~#ln2HI_exp~0.base, 8 + ~#ln2HI_exp~0.offset, 8);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(16, 6);call write~init~real(1.9082149292705877E-10, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 8);call write~init~real(~someUnaryDOUBLEoperation(1.9082149292705877E-10), ~#ln2LO_exp~0.base, 8 + ~#ln2LO_exp~0.offset, 8);~invln2_exp~0 := 1.4426950408889634;~P1_exp~0 := 0.16666666666666602;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.0027777777777015593);~P3_exp~0 := 6.613756321437934E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533902205465252E-6);~P5_exp~0 := 4.1381367970572385E-8; {50#true} is VALID [2022-02-20 16:33:50,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret19#1, main_#t~ret20#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0);assume { :begin_inline___ieee754_exp } true;__ieee754_exp_#in~x#1 := main_~x~0#1;havoc __ieee754_exp_#res#1;havoc __ieee754_exp_#t~mem4#1, __ieee754_exp_~#gh_u~0#1.base, __ieee754_exp_~#gh_u~0#1.offset, __ieee754_exp_#t~mem6#1, __ieee754_exp_~#gl_u~0#1.base, __ieee754_exp_~#gl_u~0#1.offset, __ieee754_exp_#t~ite7#1, __ieee754_exp_~lx~0#1, __ieee754_exp_#t~mem8#1, __ieee754_exp_#t~mem9#1, __ieee754_exp_#t~mem10#1, __ieee754_exp_#t~mem11#1, __ieee754_exp_#t~mem12#1, __ieee754_exp_#t~mem13#1, __ieee754_exp_~#gh_u~1#1.base, __ieee754_exp_~#gh_u~1#1.offset, __ieee754_exp_#t~mem14#1, __ieee754_exp_~#sh_u~0#1.base, __ieee754_exp_~#sh_u~0#1.offset, __ieee754_exp_~hy~0#1, __ieee754_exp_#t~mem15#1, __ieee754_exp_~#gh_u~2#1.base, __ieee754_exp_~#gh_u~2#1.offset, __ieee754_exp_#t~mem16#1, __ieee754_exp_~#sh_u~1#1.base, __ieee754_exp_~#sh_u~1#1.offset, __ieee754_exp_~hy~1#1, __ieee754_exp_~x#1, __ieee754_exp_~y~0#1, __ieee754_exp_~hi~0#1, __ieee754_exp_~lo~0#1, __ieee754_exp_~c~0#1, __ieee754_exp_~t~0#1, __ieee754_exp_~k~0#1, __ieee754_exp_~xsb~0#1, __ieee754_exp_~hx~0#1, __ieee754_exp_#t~nondet5#1;__ieee754_exp_~x#1 := __ieee754_exp_#in~x#1;havoc __ieee754_exp_~y~0#1;havoc __ieee754_exp_~hi~0#1;havoc __ieee754_exp_~lo~0#1;havoc __ieee754_exp_~c~0#1;havoc __ieee754_exp_~t~0#1;__ieee754_exp_~k~0#1 := 0;havoc __ieee754_exp_~xsb~0#1;havoc __ieee754_exp_~hx~0#1; {50#true} is VALID [2022-02-20 16:33:50,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {50#true} assume !true; {51#false} is VALID [2022-02-20 16:33:50,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#false} assume 0 == (if __ieee754_exp_~hx~0#1 >= 0 then 0 else 1);__ieee754_exp_~xsb~0#1 := 0; {51#false} is VALID [2022-02-20 16:33:50,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#false} __ieee754_exp_~hx~0#1 := (if 0 == __ieee754_exp_~hx~0#1 then 0 else (if 1 == __ieee754_exp_~hx~0#1 then 1 else ~bitwiseAnd(__ieee754_exp_~hx~0#1, 2147483647))); {51#false} is VALID [2022-02-20 16:33:50,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#false} assume __ieee754_exp_~hx~0#1 % 4294967296 >= 1082535490; {51#false} is VALID [2022-02-20 16:33:50,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#false} assume !(__ieee754_exp_~hx~0#1 % 4294967296 >= 2146435072); {51#false} is VALID [2022-02-20 16:33:50,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#false} assume ~someBinaryDOUBLEComparisonOperation(__ieee754_exp_~x#1, ~o_threshold_exp~0);__ieee754_exp_#res#1 := ~someBinaryArithmeticDOUBLEoperation(~huge_exp~0, ~huge_exp~0); {51#false} is VALID [2022-02-20 16:33:50,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#false} main_#t~ret19#1 := __ieee754_exp_#res#1;assume { :end_inline___ieee754_exp } true;main_~res~0#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~x~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem17#1, isinf_double_#t~mem18#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, isinf_double_~x#1, isinf_double_~hx~1#1, isinf_double_~lx~1#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~1#1;havoc isinf_double_~lx~1#1; {51#false} is VALID [2022-02-20 16:33:50,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {51#false} assume !true; {51#false} is VALID [2022-02-20 16:33:50,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {51#false} isinf_double_~hx~1#1 := (if 0 == isinf_double_~hx~1#1 then 0 else (if 1 == isinf_double_~hx~1#1 then 1 else ~bitwiseAnd(isinf_double_~hx~1#1, 2147483647)));isinf_double_~hx~1#1 := (if (if (1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) then isinf_double_~hx~1#1 else (if 0 == isinf_double_~hx~1#1 && (1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~1#1 && (1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~1#1, (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 <= 2147483647 then (if (1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) then isinf_double_~hx~1#1 else (if 0 == isinf_double_~hx~1#1 && (1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~1#1 && (1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~1#1, (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 else (if (1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) then isinf_double_~hx~1#1 else (if 0 == isinf_double_~hx~1#1 && (1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~1#1 && (1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 1 == (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~1#1, (if (if (1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 0 == -isinf_double_~lx~1#1 then isinf_double_~lx~1#1 else (if 0 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1) then -isinf_double_~lx~1#1 else (if (1 == isinf_double_~lx~1#1 && (1 == -isinf_double_~lx~1#1 || 0 == -isinf_double_~lx~1#1)) || ((1 == isinf_double_~lx~1#1 || 0 == isinf_double_~lx~1#1) && 1 == -isinf_double_~lx~1#1) then 1 else ~bitwiseOr(isinf_double_~lx~1#1, -isinf_double_~lx~1#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~1#1 := 2146435072 - isinf_double_~hx~1#1;isinf_double_#res#1 := 1 - (if (if (if (1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 0 == -isinf_double_~hx~1#1 then isinf_double_~hx~1#1 else (if 0 == isinf_double_~hx~1#1 && (1 == -isinf_double_~hx~1#1 || 0 == -isinf_double_~hx~1#1) then -isinf_double_~hx~1#1 else (if (1 == isinf_double_~hx~1#1 && (1 == -isinf_double_~hx~1#1 || 0 == -isinf_double_~hx~1#1)) || ((1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 1 == -isinf_double_~hx~1#1) then 1 else ~bitwiseOr(isinf_double_~hx~1#1, -isinf_double_~hx~1#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 <= 2147483647 then (if (if (1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 0 == -isinf_double_~hx~1#1 then isinf_double_~hx~1#1 else (if 0 == isinf_double_~hx~1#1 && (1 == -isinf_double_~hx~1#1 || 0 == -isinf_double_~hx~1#1) then -isinf_double_~hx~1#1 else (if (1 == isinf_double_~hx~1#1 && (1 == -isinf_double_~hx~1#1 || 0 == -isinf_double_~hx~1#1)) || ((1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 1 == -isinf_double_~hx~1#1) then 1 else ~bitwiseOr(isinf_double_~hx~1#1, -isinf_double_~hx~1#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 else (if (if (1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 0 == -isinf_double_~hx~1#1 then isinf_double_~hx~1#1 else (if 0 == isinf_double_~hx~1#1 && (1 == -isinf_double_~hx~1#1 || 0 == -isinf_double_~hx~1#1) then -isinf_double_~hx~1#1 else (if (1 == isinf_double_~hx~1#1 && (1 == -isinf_double_~hx~1#1 || 0 == -isinf_double_~hx~1#1)) || ((1 == isinf_double_~hx~1#1 || 0 == isinf_double_~hx~1#1) && 1 == -isinf_double_~hx~1#1) then 1 else ~bitwiseOr(isinf_double_~hx~1#1, -isinf_double_~hx~1#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 - 4294967296); {51#false} is VALID [2022-02-20 16:33:50,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {51#false} main_#t~ret20#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true;assume -2147483648 <= main_#t~ret20#1 && main_#t~ret20#1 <= 2147483647; {51#false} is VALID [2022-02-20 16:33:50,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {51#false} assume 0 == main_#t~ret20#1;havoc main_#t~ret20#1; {51#false} is VALID [2022-02-20 16:33:50,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {51#false} assume !false; {51#false} is VALID [2022-02-20 16:33:50,922 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:33:50,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:33:50,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438732709] [2022-02-20 16:33:50,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438732709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:33:50,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:33:50,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:33:50,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466168886] [2022-02-20 16:33:50,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:33:50,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:33:50,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:33:50,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:50,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:33:50,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:33:50,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:33:50,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:33:50,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:33:50,988 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.711111111111111) internal successors, (77), 46 states have internal predecessors, (77), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:51,052 INFO L93 Difference]: Finished difference Result 91 states and 150 transitions. [2022-02-20 16:33:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:33:51,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:33:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:33:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 150 transitions. [2022-02-20 16:33:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 150 transitions. [2022-02-20 16:33:51,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 150 transitions. [2022-02-20 16:33:51,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:33:51,236 INFO L225 Difference]: With dead ends: 91 [2022-02-20 16:33:51,236 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:33:51,239 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:33:51,246 INFO L933 BasicCegarLoop]: 59 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, 59 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:33:51,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:33:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:33:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 16:33:51,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:33:51,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:51,272 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:51,273 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:51,279 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-20 16:33:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-20 16:33:51,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:51,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:51,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 16:33:51,284 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 16:33:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:51,287 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-02-20 16:33:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-20 16:33:51,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:51,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:51,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:33:51,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:33:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2022-02-20 16:33:51,293 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 14 [2022-02-20 16:33:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:33:51,293 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2022-02-20 16:33:51,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:33:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-02-20 16:33:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:33:51,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:51,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:51,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:33:51,302 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1088901572, now seen corresponding path program 1 times [2022-02-20 16:33:51,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:33:51,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273881303] [2022-02-20 16:33:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:33:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:33:51,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:33:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:33:51,826 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:33:51,826 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:33:51,828 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:33:51,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:33:51,832 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:33:51,833 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:33:51,872 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:33:51,872 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:33:51,872 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 16:33:51,872 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2022-02-20 16:33:51,872 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-02-20 16:33:51,872 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L56-7 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:33:51,873 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L56-5 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L56-5 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:33:51,874 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:33:51,875 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L136-3 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:33:51,876 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:33:51,877 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:33:51,877 WARN L170 areAnnotationChecker]: L104-2 has no Hoare annotation [2022-02-20 16:33:51,877 WARN L170 areAnnotationChecker]: L104-2 has no Hoare annotation [2022-02-20 16:33:51,877 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-02-20 16:33:51,878 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-02-20 16:33:51,878 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:33:51,878 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L109-2 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: L123-2 has no Hoare annotation [2022-02-20 16:33:51,879 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:33:51,879 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:33:51,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:33:51 BoogieIcfgContainer [2022-02-20 16:33:51,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:33:51,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:33:51,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:33:51,882 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:33:51,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:50" (3/4) ... [2022-02-20 16:33:51,885 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:33:51,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:33:51,886 INFO L158 Benchmark]: Toolchain (without parser) took 2184.92ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 59.6MB in the beginning and 60.0MB in the end (delta: -440.0kB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2022-02-20 16:33:51,886 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:33:51,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.49ms. Allocated memory is still 92.3MB. Free memory was 59.4MB in the beginning and 64.9MB in the end (delta: -5.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 16:33:51,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.28ms. Allocated memory is still 92.3MB. Free memory was 64.9MB in the beginning and 59.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:33:51,888 INFO L158 Benchmark]: Boogie Preprocessor took 39.75ms. Allocated memory is still 92.3MB. Free memory was 59.3MB in the beginning and 56.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:33:51,889 INFO L158 Benchmark]: RCFGBuilder took 571.64ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 56.1MB in the beginning and 71.9MB in the end (delta: -15.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-02-20 16:33:51,889 INFO L158 Benchmark]: TraceAbstraction took 1222.30ms. Allocated memory is still 121.6MB. Free memory was 71.9MB in the beginning and 60.1MB in the end (delta: 11.9MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-02-20 16:33:51,889 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 121.6MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 52.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:33:51,891 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 92.3MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.49ms. Allocated memory is still 92.3MB. Free memory was 59.4MB in the beginning and 64.9MB in the end (delta: -5.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.28ms. Allocated memory is still 92.3MB. Free memory was 64.9MB in the beginning and 59.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.75ms. Allocated memory is still 92.3MB. Free memory was 59.3MB in the beginning and 56.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.64ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 56.1MB in the beginning and 71.9MB in the end (delta: -15.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1222.30ms. Allocated memory is still 121.6MB. Free memory was 71.9MB in the beginning and 60.1MB in the end (delta: 11.9MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 121.6MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 52.3kB). 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: 160]: 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 143, overapproximation of someUnaryDOUBLEoperation at line 23, overapproximation of someBinaryArithmeticDOUBLEoperation at line 73, overapproximation of bitwiseAnd at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L19-L44] static const double one_exp = 1.0, halF_exp[2] = { 0.5, -0.5, }, huge_exp = 1.0e+300, twom1000_exp = 9.33263618503218878990e-302, o_threshold_exp = 7.09782712893383973096e+02, u_threshold_exp = -7.45133219101941108420e+02, ln2HI_exp[2] = { 6.93147180369123816490e-01, -6.93147180369123816490e-01, }, ln2LO_exp[2] = { 1.90821492927058770002e-10, -1.90821492927058770002e-10, }, invln2_exp = 1.44269504088896338700e+00, P1_exp = 1.66666666666666019037e-01, P2_exp = -2.77777777770155933842e-03, P3_exp = 6.61375632143793436117e-05, P4_exp = -1.65339022054652515390e-06, P5_exp = 4.13813679705723846039e-08; VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L155] double x = 1.0 / 0.0; [L156] CALL, EXPR __ieee754_exp(x) [L47] double y, hi, lo, c, t; [L48] __int32_t k = 0, xsb; [L49] __uint32_t hx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003] [L52] ieee_double_shape_type gh_u; [L53] gh_u.value = (x) [L54] EXPR gh_u.parts.msw [L54] (hx) = gh_u.parts.msw [L56] xsb = (hx >> 31) & 1 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=10, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L57] hx &= 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1082535490, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L59] COND TRUE hx >= 0x40862E42 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1082535490, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L60] COND FALSE !(hx >= 0x7ff00000) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1082535490, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L72] COND TRUE x > o_threshold_exp [L73] return huge_exp * huge_exp; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=1082535490, invln2_exp=1442695040888963387/1000000000000000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, xsb=0] [L156] RET, EXPR __ieee754_exp(x) [L156] double res = __ieee754_exp(x); [L159] CALL, EXPR isinf_double(x) [L135] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003] [L137] ieee_double_shape_type ew_u; [L138] ew_u.value = (x) [L139] EXPR ew_u.parts.msw [L139] (hx) = ew_u.parts.msw [L140] EXPR ew_u.parts.lsw [L140] (lx) = ew_u.parts.lsw [L142] hx &= 0x7fffffff [L143] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L144] hx = 0x7ff00000 - hx [L145] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \result=0, halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-2, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, lx=-2147483648, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003] [L159] RET, EXPR isinf_double(x) [L159] COND TRUE !isinf_double(x) [L160] reach_error() VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, invln2_exp=1442695040888963387/1000000000000000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, o_threshold_exp=88722839111672996637/125000000000000000, one_exp=1, P1_exp=166666666666666019037/1000000000000000000000, P3_exp=661375632143793436117/10000000000000000000000000, P5_exp=413813679705723846039/10000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, twom1000_exp=93326361850321887899/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, 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, 59 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, 59 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=47occurred 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.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 13 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:33:51,927 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_0834.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 128b4841c61be319288af708e8567b4a053d8431485e24fb8ee12b4e2218f817 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:33:53,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:33:53,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:33:53,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:33:53,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:33:53,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:33:53,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:33:53,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:33:53,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:33:53,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:33:53,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:33:53,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:33:53,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:33:53,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:33:53,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:33:53,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:33:53,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:33:53,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:33:53,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:33:53,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:33:53,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:33:53,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:33:53,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:33:53,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:33:53,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:33:53,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:33:53,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:33:53,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:33:53,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:33:53,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:33:53,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:33:53,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:33:53,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:33:53,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:33:53,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:33:53,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:33:53,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:33:53,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:33:53,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:33:53,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:33:53,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:33:53,727 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:33:53,764 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:33:53,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:33:53,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:33:53,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:33:53,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:33:53,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:33:53,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:33:53,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:33:53,768 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:33:53,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:33:53,769 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:33:53,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:33:53,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:33:53,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:33:53,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:33:53,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:33:53,770 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:33:53,770 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:33:53,770 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:33:53,771 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:33:53,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:33:53,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:33:53,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:33:53,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:33:53,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:33:53,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:33:53,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:53,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:33:53,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:33:53,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:33:53,772 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:33:53,772 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:33:53,773 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:33:53,773 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:33:53,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:33:53,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:33:53,773 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 -> 128b4841c61be319288af708e8567b4a053d8431485e24fb8ee12b4e2218f817 [2022-02-20 16:33:54,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:33:54,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:33:54,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:33:54,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:33:54,074 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:33:54,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0834.c [2022-02-20 16:33:54,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c565243b/0790f62461344587aa9389709b68a3b0/FLAG5ce2ca4da [2022-02-20 16:33:54,461 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:33:54,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0834.c [2022-02-20 16:33:54,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c565243b/0790f62461344587aa9389709b68a3b0/FLAG5ce2ca4da [2022-02-20 16:33:54,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c565243b/0790f62461344587aa9389709b68a3b0 [2022-02-20 16:33:54,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:33:54,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:33:54,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:54,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:33:54,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:33:54,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75af51b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54, skipping insertion in model container [2022-02-20 16:33:54,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:33:54,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:33:55,001 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_0834.c[4256,4269] [2022-02-20 16:33:55,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:55,044 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:33:55,069 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_0834.c[4256,4269] [2022-02-20 16:33:55,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:55,093 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:33:55,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55 WrapperNode [2022-02-20 16:33:55,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:55,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:55,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:33:55,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:33:55,099 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:33:55" (1/1) ... [2022-02-20 16:33:55,108 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:33:55" (1/1) ... [2022-02-20 16:33:55,136 INFO L137 Inliner]: procedures = 21, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 203 [2022-02-20 16:33:55,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:55,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:33:55,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:33:55,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:33:55,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (1/1) ... [2022-02-20 16:33:55,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (1/1) ... [2022-02-20 16:33:55,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (1/1) ... [2022-02-20 16:33:55,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (1/1) ... [2022-02-20 16:33:55,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (1/1) ... [2022-02-20 16:33:55,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (1/1) ... [2022-02-20 16:33:55,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (1/1) ... [2022-02-20 16:33:55,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:33:55,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:33:55,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:33:55,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:33:55,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (1/1) ... [2022-02-20 16:33:55,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:55,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:33:55,218 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:33:55,220 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:33:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:33:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:33:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:33:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:33:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:33:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-02-20 16:33:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:33:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:33:55,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:33:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:33:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:33:55,305 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:33:55,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:34:08,174 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:34:08,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:34:08,182 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:34:08,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:34:08 BoogieIcfgContainer [2022-02-20 16:34:08,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:34:08,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:34:08,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:34:08,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:34:08,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:33:54" (1/3) ... [2022-02-20 16:34:08,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263a08c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:34:08, skipping insertion in model container [2022-02-20 16:34:08,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:55" (2/3) ... [2022-02-20 16:34:08,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263a08c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:34:08, skipping insertion in model container [2022-02-20 16:34:08,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:34:08" (3/3) ... [2022-02-20 16:34:08,189 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0834.c [2022-02-20 16:34:08,192 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:34:08,192 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:34:08,217 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:34:08,222 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:34:08,222 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:34:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 states have internal predecessors, (69), 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:34:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:34:08,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:34:08,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:34:08,237 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:34:08,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:34:08,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1546239330, now seen corresponding path program 1 times [2022-02-20 16:34:08,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:34:08,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621842938] [2022-02-20 16:34:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:34:08,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:34:08,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:34:08,268 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:34:08,269 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:34:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:34:08,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:34:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:34:08,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:34:08,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#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);~one_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0);~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(16bv32, 4bv32);call write~init~intFLOATTYPE8(~to_fp~DOUBLE(currentRoundingMode, 0.5), ~#halF_exp~0.base, ~#halF_exp~0.offset, 8bv32);call write~init~intFLOATTYPE8(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~bvadd32(8bv32, ~#halF_exp~0.offset), 8bv32);~huge_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300);~twom1000_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 9.332636185032189E-302);~o_threshold_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 709.782712893384);~u_threshold_exp~0 := ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 745.1332191019411));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(16bv32, 5bv32);call write~init~intFLOATTYPE8(~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 8bv32);call write~init~intFLOATTYPE8(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238)), ~#ln2HI_exp~0.base, ~bvadd32(8bv32, ~#ln2HI_exp~0.offset), 8bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(16bv32, 6bv32);call write~init~intFLOATTYPE8(~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 8bv32);call write~init~intFLOATTYPE8(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10)), ~#ln2LO_exp~0.base, ~bvadd32(8bv32, ~#ln2LO_exp~0.offset), 8bv32);~invln2_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.4426950408889634);~P1_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.16666666666666602);~P2_exp~0 := ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.0027777777777015593));~P3_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 6.613756321437934E-5);~P4_exp~0 := ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533902205465252E-6));~P5_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 4.1381367970572385E-8); {46#true} is VALID [2022-02-20 16:34:08,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_exp } true;__ieee754_exp_#in~x#1 := main_~x~0#1;havoc __ieee754_exp_#res#1;havoc __ieee754_exp_#t~mem4#1, __ieee754_exp_~#gh_u~0#1.base, __ieee754_exp_~#gh_u~0#1.offset, __ieee754_exp_#t~mem5#1, __ieee754_exp_~#gl_u~0#1.base, __ieee754_exp_~#gl_u~0#1.offset, __ieee754_exp_#t~ite6#1, __ieee754_exp_~lx~0#1, __ieee754_exp_#t~mem7#1, __ieee754_exp_#t~mem8#1, __ieee754_exp_#t~mem9#1, __ieee754_exp_#t~mem10#1, __ieee754_exp_#t~mem11#1, __ieee754_exp_#t~mem12#1, __ieee754_exp_~#gh_u~1#1.base, __ieee754_exp_~#gh_u~1#1.offset, __ieee754_exp_#t~mem13#1, __ieee754_exp_~#sh_u~0#1.base, __ieee754_exp_~#sh_u~0#1.offset, __ieee754_exp_~hy~0#1, __ieee754_exp_#t~mem14#1, __ieee754_exp_~#gh_u~2#1.base, __ieee754_exp_~#gh_u~2#1.offset, __ieee754_exp_#t~mem15#1, __ieee754_exp_~#sh_u~1#1.base, __ieee754_exp_~#sh_u~1#1.offset, __ieee754_exp_~hy~1#1, __ieee754_exp_~x#1, __ieee754_exp_~y~0#1, __ieee754_exp_~hi~0#1, __ieee754_exp_~lo~0#1, __ieee754_exp_~c~0#1, __ieee754_exp_~t~0#1, __ieee754_exp_~k~0#1, __ieee754_exp_~xsb~0#1, __ieee754_exp_~hx~0#1;__ieee754_exp_~x#1 := __ieee754_exp_#in~x#1;havoc __ieee754_exp_~y~0#1;havoc __ieee754_exp_~hi~0#1;havoc __ieee754_exp_~lo~0#1;havoc __ieee754_exp_~c~0#1;havoc __ieee754_exp_~t~0#1;__ieee754_exp_~k~0#1 := 0bv32;havoc __ieee754_exp_~xsb~0#1;havoc __ieee754_exp_~hx~0#1; {46#true} is VALID [2022-02-20 16:34:08,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume !true; {47#false} is VALID [2022-02-20 16:34:08,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#false} __ieee754_exp_~xsb~0#1 := ~bvand32(1bv32, ~bvlshr32(__ieee754_exp_~hx~0#1, 31bv32));__ieee754_exp_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_exp_~hx~0#1); {47#false} is VALID [2022-02-20 16:34:08,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#false} assume ~bvuge32(__ieee754_exp_~hx~0#1, 1082535490bv32); {47#false} is VALID [2022-02-20 16:34:08,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#false} assume !~bvuge32(__ieee754_exp_~hx~0#1, 2146435072bv32); {47#false} is VALID [2022-02-20 16:34:08,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#false} assume ~fp.gt~DOUBLE(__ieee754_exp_~x#1, ~o_threshold_exp~0);__ieee754_exp_#res#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~huge_exp~0, ~huge_exp~0); {47#false} is VALID [2022-02-20 16:34:08,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#false} main_#t~ret18#1 := __ieee754_exp_#res#1;assume { :end_inline___ieee754_exp } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~x~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem16#1, isinf_double_#t~mem17#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, isinf_double_~x#1, isinf_double_~hx~1#1, isinf_double_~lx~1#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~1#1;havoc isinf_double_~lx~1#1; {47#false} is VALID [2022-02-20 16:34:08,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#false} assume !true; {47#false} is VALID [2022-02-20 16:34:08,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#false} isinf_double_~hx~1#1 := ~bvand32(2147483647bv32, isinf_double_~hx~1#1);isinf_double_~hx~1#1 := ~bvor32(isinf_double_~hx~1#1, ~bvlshr32(~bvor32(isinf_double_~lx~1#1, ~bvneg32(isinf_double_~lx~1#1)), 31bv32));isinf_double_~hx~1#1 := ~bvsub32(2146435072bv32, isinf_double_~hx~1#1);isinf_double_#res#1 := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~1#1, ~bvneg32(isinf_double_~hx~1#1)), 31bv32)); {47#false} is VALID [2022-02-20 16:34:08,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#false} main_#t~ret19#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true; {47#false} is VALID [2022-02-20 16:34:08,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#false} assume 0bv32 == main_#t~ret19#1;havoc main_#t~ret19#1; {47#false} is VALID [2022-02-20 16:34:08,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-02-20 16:34:08,792 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:34:08,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:34:08,792 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:34:08,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621842938] [2022-02-20 16:34:08,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621842938] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:34:08,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:34:08,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:34:08,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279443357] [2022-02-20 16:34:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:34:08,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:34:08,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:34:08,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:34:08,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:34:08,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:34:08,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:34:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:34:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:34:08,947 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 42 states have internal predecessors, (69), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:34:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:21,409 INFO L93 Difference]: Finished difference Result 84 states and 136 transitions. [2022-02-20 16:34:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:34:21,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:34:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:34:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:34:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2022-02-20 16:34:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:34:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2022-02-20 16:34:21,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 136 transitions. [2022-02-20 16:34:32,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:34:32,663 INFO L225 Difference]: With dead ends: 84 [2022-02-20 16:34:32,663 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:34:32,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:34:32,668 INFO L933 BasicCegarLoop]: 54 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, 54 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:34:32,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:34:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:34:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 16:34:32,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:34:32,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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:34:32,688 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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:34:32,689 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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:34:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:32,692 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-02-20 16:34:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 16:34:32,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:32,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:34:32,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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 40 states. [2022-02-20 16:34:32,693 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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 40 states. [2022-02-20 16:34:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:32,696 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-02-20 16:34:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 16:34:32,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:32,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:34:32,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:34:32,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:34:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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:34:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-02-20 16:34:32,700 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 13 [2022-02-20 16:34:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:34:32,701 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-02-20 16:34:32,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:34:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 16:34:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:34:32,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:34:32,702 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:34:32,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:34:32,913 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:34:32,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:34:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:34:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1188959094, now seen corresponding path program 1 times [2022-02-20 16:34:32,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:34:32,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063394814] [2022-02-20 16:34:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:34:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:34:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:34:32,916 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:34:32,917 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:34:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:34:33,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:34:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:34:33,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:34:34,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#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);~one_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0);~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(16bv32, 4bv32);call write~init~intFLOATTYPE8(~to_fp~DOUBLE(currentRoundingMode, 0.5), ~#halF_exp~0.base, ~#halF_exp~0.offset, 8bv32);call write~init~intFLOATTYPE8(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~bvadd32(8bv32, ~#halF_exp~0.offset), 8bv32);~huge_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300);~twom1000_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 9.332636185032189E-302);~o_threshold_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 709.782712893384);~u_threshold_exp~0 := ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 745.1332191019411));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(16bv32, 5bv32);call write~init~intFLOATTYPE8(~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 8bv32);call write~init~intFLOATTYPE8(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238)), ~#ln2HI_exp~0.base, ~bvadd32(8bv32, ~#ln2HI_exp~0.offset), 8bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(16bv32, 6bv32);call write~init~intFLOATTYPE8(~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 8bv32);call write~init~intFLOATTYPE8(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10)), ~#ln2LO_exp~0.base, ~bvadd32(8bv32, ~#ln2LO_exp~0.offset), 8bv32);~invln2_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.4426950408889634);~P1_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.16666666666666602);~P2_exp~0 := ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.0027777777777015593));~P3_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 6.613756321437934E-5);~P4_exp~0 := ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533902205465252E-6));~P5_exp~0 := ~to_fp~DOUBLE(currentRoundingMode, 4.1381367970572385E-8); {313#true} is VALID [2022-02-20 16:34:34,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_exp } true;__ieee754_exp_#in~x#1 := main_~x~0#1;havoc __ieee754_exp_#res#1;havoc __ieee754_exp_#t~mem4#1, __ieee754_exp_~#gh_u~0#1.base, __ieee754_exp_~#gh_u~0#1.offset, __ieee754_exp_#t~mem5#1, __ieee754_exp_~#gl_u~0#1.base, __ieee754_exp_~#gl_u~0#1.offset, __ieee754_exp_#t~ite6#1, __ieee754_exp_~lx~0#1, __ieee754_exp_#t~mem7#1, __ieee754_exp_#t~mem8#1, __ieee754_exp_#t~mem9#1, __ieee754_exp_#t~mem10#1, __ieee754_exp_#t~mem11#1, __ieee754_exp_#t~mem12#1, __ieee754_exp_~#gh_u~1#1.base, __ieee754_exp_~#gh_u~1#1.offset, __ieee754_exp_#t~mem13#1, __ieee754_exp_~#sh_u~0#1.base, __ieee754_exp_~#sh_u~0#1.offset, __ieee754_exp_~hy~0#1, __ieee754_exp_#t~mem14#1, __ieee754_exp_~#gh_u~2#1.base, __ieee754_exp_~#gh_u~2#1.offset, __ieee754_exp_#t~mem15#1, __ieee754_exp_~#sh_u~1#1.base, __ieee754_exp_~#sh_u~1#1.offset, __ieee754_exp_~hy~1#1, __ieee754_exp_~x#1, __ieee754_exp_~y~0#1, __ieee754_exp_~hi~0#1, __ieee754_exp_~lo~0#1, __ieee754_exp_~c~0#1, __ieee754_exp_~t~0#1, __ieee754_exp_~k~0#1, __ieee754_exp_~xsb~0#1, __ieee754_exp_~hx~0#1;__ieee754_exp_~x#1 := __ieee754_exp_#in~x#1;havoc __ieee754_exp_~y~0#1;havoc __ieee754_exp_~hi~0#1;havoc __ieee754_exp_~lo~0#1;havoc __ieee754_exp_~c~0#1;havoc __ieee754_exp_~t~0#1;__ieee754_exp_~k~0#1 := 0bv32;havoc __ieee754_exp_~xsb~0#1;havoc __ieee754_exp_~hx~0#1; {321#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_exp_~x#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))} is VALID [2022-02-20 16:34:34,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {321#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_exp_~x#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))} call __ieee754_exp_~#gh_u~0#1.base, __ieee754_exp_~#gh_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__ieee754_exp_~x#1, __ieee754_exp_~#gh_u~0#1.base, __ieee754_exp_~#gh_u~0#1.offset, 8bv32);call __ieee754_exp_#t~mem4#1 := read~intINTTYPE4(__ieee754_exp_~#gh_u~0#1.base, ~bvadd32(4bv32, __ieee754_exp_~#gh_u~0#1.offset), 4bv32);__ieee754_exp_~hx~0#1 := __ieee754_exp_#t~mem4#1;havoc __ieee754_exp_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_exp_~#gh_u~0#1.base, __ieee754_exp_~#gh_u~0#1.offset);havoc __ieee754_exp_~#gh_u~0#1.base, __ieee754_exp_~#gh_u~0#1.offset; {325#(exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_exp_~hx~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|))))} is VALID [2022-02-20 16:34:34,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {325#(exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_exp_~hx~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|))))} goto; {325#(exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_exp_~hx~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|))))} is VALID [2022-02-20 16:34:34,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {325#(exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_exp_~hx~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|))))} __ieee754_exp_~xsb~0#1 := ~bvand32(1bv32, ~bvlshr32(__ieee754_exp_~hx~0#1, 31bv32));__ieee754_exp_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_exp_~hx~0#1); {325#(exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_exp_~hx~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|))))} is VALID [2022-02-20 16:34:34,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#(exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_exp_~hx~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|))))} assume ~bvuge32(__ieee754_exp_~hx~0#1, 1082535490bv32); {325#(exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_exp_~hx~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|))))} is VALID [2022-02-20 16:34:34,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_exp_~hx~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|))))} assume !~bvuge32(__ieee754_exp_~hx~0#1, 2146435072bv32); {314#false} is VALID [2022-02-20 16:34:34,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#false} assume ~fp.gt~DOUBLE(__ieee754_exp_~x#1, ~o_threshold_exp~0);__ieee754_exp_#res#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~huge_exp~0, ~huge_exp~0); {314#false} is VALID [2022-02-20 16:34:34,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#false} main_#t~ret18#1 := __ieee754_exp_#res#1;assume { :end_inline___ieee754_exp } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~x~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem16#1, isinf_double_#t~mem17#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, isinf_double_~x#1, isinf_double_~hx~1#1, isinf_double_~lx~1#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~1#1;havoc isinf_double_~lx~1#1; {314#false} is VALID [2022-02-20 16:34:34,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#false} call isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, 8bv32);call isinf_double_#t~mem16#1 := read~intINTTYPE4(isinf_double_~#ew_u~0#1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~0#1.offset), 4bv32);isinf_double_~hx~1#1 := isinf_double_#t~mem16#1;havoc isinf_double_#t~mem16#1;call isinf_double_#t~mem17#1 := read~intINTTYPE4(isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, 4bv32);isinf_double_~lx~1#1 := isinf_double_#t~mem17#1;havoc isinf_double_#t~mem17#1;call ULTIMATE.dealloc(isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset);havoc isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset; {314#false} is VALID [2022-02-20 16:34:34,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#false} goto; {314#false} is VALID [2022-02-20 16:34:34,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#false} isinf_double_~hx~1#1 := ~bvand32(2147483647bv32, isinf_double_~hx~1#1);isinf_double_~hx~1#1 := ~bvor32(isinf_double_~hx~1#1, ~bvlshr32(~bvor32(isinf_double_~lx~1#1, ~bvneg32(isinf_double_~lx~1#1)), 31bv32));isinf_double_~hx~1#1 := ~bvsub32(2146435072bv32, isinf_double_~hx~1#1);isinf_double_#res#1 := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~1#1, ~bvneg32(isinf_double_~hx~1#1)), 31bv32)); {314#false} is VALID [2022-02-20 16:34:34,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} main_#t~ret19#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true; {314#false} is VALID [2022-02-20 16:34:34,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#false} assume 0bv32 == main_#t~ret19#1;havoc main_#t~ret19#1; {314#false} is VALID [2022-02-20 16:34:34,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-02-20 16:34:34,555 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:34:34,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:34:34,556 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:34:34,556 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063394814] [2022-02-20 16:34:34,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063394814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:34:34,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:34:34,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:34:34,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027251850] [2022-02-20 16:34:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:34:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-02-20 16:34:34,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:34:34,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:34:34,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:34:34,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:34:34,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:34:34,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:34:34,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:34:34,694 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:34:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:57,334 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-02-20 16:34:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:34:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-02-20 16:34:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:34:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:34:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-02-20 16:34:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:34:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-02-20 16:34:57,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2022-02-20 16:35:08,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:35:08,471 INFO L225 Difference]: With dead ends: 66 [2022-02-20 16:35:08,471 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:35:08,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:35:08,472 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:35:08,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-02-20 16:35:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:35:08,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 16:35:08,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:35:08,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 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:08,475 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 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:08,476 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 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:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:08,477 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 16:35:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 16:35:08,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:35:08,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:35:08,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 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 38 states. [2022-02-20 16:35:08,478 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 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 38 states. [2022-02-20 16:35:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:08,479 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 16:35:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 16:35:08,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:35:08,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:35:08,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:35:08,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:35:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 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:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-02-20 16:35:08,481 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 15 [2022-02-20 16:35:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:35:08,482 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-02-20 16:35:08,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 16:35:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:35:08,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:08,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:08,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:35:08,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:35:08,696 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash -153755969, now seen corresponding path program 1 times [2022-02-20 16:35:08,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:35:08,698 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858273053] [2022-02-20 16:35:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:08,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:35:08,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:35:08,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:35:08,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:35:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:08,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:35:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:08,973 INFO L286 TraceCheckSpWp]: Computing forward predicates...