./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1052b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_1052b.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 e723e72a166ac6fb1b462e1c13b91930c5f4e10bc44198831987bd0b753e97c5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:47:45,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:47:45,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:47:45,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:47:45,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:47:45,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:47:45,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:47:45,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:47:45,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:47:45,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:47:45,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:47:45,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:47:45,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:47:45,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:47:45,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:47:45,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:47:45,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:47:45,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:47:45,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:47:45,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:47:45,732 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:47:45,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:47:45,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:47:45,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:47:45,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:47:45,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:47:45,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:47:45,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:47:45,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:47:45,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:47:45,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:47:45,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:47:45,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:47:45,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:47:45,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:47:45,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:47:45,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:47:45,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:47:45,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:47:45,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:47:45,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:47:45,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:47:45,754 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:47:45,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:47:45,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:47:45,776 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:47:45,777 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:47:45,777 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:47:45,777 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:47:45,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:47:45,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:47:45,778 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:47:45,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:47:45,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:47:45,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:47:45,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:47:45,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:47:45,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:47:45,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:47:45,786 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:47:45,786 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:47:45,786 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:47:45,786 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:47:45,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:47:45,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:47:45,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:47:45,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:47:45,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:47:45,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:47:45,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:47:45,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:47:45,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:47:45,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:47:45,788 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:47:45,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:47:45,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:47:45,789 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 -> e723e72a166ac6fb1b462e1c13b91930c5f4e10bc44198831987bd0b753e97c5 [2022-07-21 01:47:46,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:47:46,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:47:46,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:47:46,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:47:46,095 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:47:46,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052b.c [2022-07-21 01:47:46,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd31d4fcd/4148680d9baa4b1eba69014a69c4d707/FLAG146c23fd8 [2022-07-21 01:47:46,516 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:47:46,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052b.c [2022-07-21 01:47:46,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd31d4fcd/4148680d9baa4b1eba69014a69c4d707/FLAG146c23fd8 [2022-07-21 01:47:46,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd31d4fcd/4148680d9baa4b1eba69014a69c4d707 [2022-07-21 01:47:46,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:47:46,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:47:46,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:47:46,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:47:46,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:47:46,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1321cdc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46, skipping insertion in model container [2022-07-21 01:47:46,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:47:46,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:47:46,720 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_1052b.c[2416,2429] [2022-07-21 01:47:46,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:47:46,726 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:47:46,792 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_1052b.c[2416,2429] [2022-07-21 01:47:46,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:47:46,804 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:47:46,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46 WrapperNode [2022-07-21 01:47:46,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:47:46,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:47:46,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:47:46,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:47:46,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,864 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-21 01:47:46,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:47:46,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:47:46,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:47:46,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:47:46,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:47:46,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:47:46,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:47:46,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:47:46,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (1/1) ... [2022-07-21 01:47:46,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:47:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:47:46,944 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-07-21 01:47:46,962 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-07-21 01:47:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:47:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:47:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:47:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-21 01:47:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 01:47:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-21 01:47:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:47:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:47:46,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 01:47:46,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:47:47,058 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:47:47,060 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:47:47,361 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:47:47,366 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:47:47,366 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 01:47:47,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:47:47 BoogieIcfgContainer [2022-07-21 01:47:47,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:47:47,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:47:47,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:47:47,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:47:47,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:47:46" (1/3) ... [2022-07-21 01:47:47,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d85e803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:47:47, skipping insertion in model container [2022-07-21 01:47:47,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:46" (2/3) ... [2022-07-21 01:47:47,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d85e803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:47:47, skipping insertion in model container [2022-07-21 01:47:47,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:47:47" (3/3) ... [2022-07-21 01:47:47,373 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052b.c [2022-07-21 01:47:47,382 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:47:47,382 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:47:47,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:47:47,434 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38f542a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d0d9a6c [2022-07-21 01:47:47,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:47:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 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-07-21 01:47:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 01:47:47,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:47:47,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:47:47,443 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:47:47,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:47:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash 658478814, now seen corresponding path program 1 times [2022-07-21 01:47:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:47:47,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116688048] [2022-07-21 01:47:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:47:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:47:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:47:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:47:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:47:47,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116688048] [2022-07-21 01:47:47,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116688048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:47:47,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:47:47,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:47:47,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182792703] [2022-07-21 01:47:47,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:47:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:47:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:47:47,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:47:47,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:47:47,614 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 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-07-21 01:47:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:47:47,630 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2022-07-21 01:47:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:47:47,632 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-07-21 01:47:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:47:47,637 INFO L225 Difference]: With dead ends: 72 [2022-07-21 01:47:47,637 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 01:47:47,640 INFO L412 NwaCegarLoop]: 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-07-21 01:47:47,645 INFO L413 NwaCegarLoop]: 51 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, 51 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-07-21 01:47:47,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:47:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 01:47:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-21 01:47:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:47:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-21 01:47:47,671 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 13 [2022-07-21 01:47:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:47:47,672 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-21 01:47:47,672 INFO L496 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-07-21 01:47:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-21 01:47:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 01:47:47,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:47:47,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:47:47,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:47:47,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:47:47,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:47:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1562173395, now seen corresponding path program 1 times [2022-07-21 01:47:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:47:47,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949312867] [2022-07-21 01:47:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:47:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:47:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:47:48,016 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:47:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:47:48,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:47:48,197 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:47:48,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:47:48,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:47:48,203 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-21 01:47:48,207 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:47:48,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:47:48 BoogieIcfgContainer [2022-07-21 01:47:48,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:47:48,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:47:48,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:47:48,240 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:47:48,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:47:47" (3/4) ... [2022-07-21 01:47:48,242 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:47:48,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:47:48,244 INFO L158 Benchmark]: Toolchain (without parser) took 1712.08ms. Allocated memory was 54.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Free memory was 33.5MB in the beginning and 47.3MB in the end (delta: -13.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-07-21 01:47:48,244 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:47:48,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.75ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 33.3MB in the beginning and 53.4MB in the end (delta: -20.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-07-21 01:47:48,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.59ms. Allocated memory is still 71.3MB. Free memory was 53.4MB in the beginning and 49.5MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:47:48,249 INFO L158 Benchmark]: Boogie Preprocessor took 51.08ms. Allocated memory is still 71.3MB. Free memory was 49.2MB in the beginning and 46.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:47:48,249 INFO L158 Benchmark]: RCFGBuilder took 449.27ms. Allocated memory is still 71.3MB. Free memory was 46.6MB in the beginning and 43.2MB in the end (delta: 3.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2022-07-21 01:47:48,249 INFO L158 Benchmark]: TraceAbstraction took 870.44ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 42.9MB in the beginning and 47.9MB in the end (delta: -5.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-07-21 01:47:48,250 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 86.0MB. Free memory was 47.9MB in the beginning and 47.3MB in the end (delta: 536.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:47:48,254 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.75ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 33.3MB in the beginning and 53.4MB in the end (delta: -20.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.59ms. Allocated memory is still 71.3MB. Free memory was 53.4MB in the beginning and 49.5MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.08ms. Allocated memory is still 71.3MB. Free memory was 49.2MB in the beginning and 46.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.27ms. Allocated memory is still 71.3MB. Free memory was 46.6MB in the beginning and 43.2MB in the end (delta: 3.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 870.44ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 42.9MB in the beginning and 47.9MB in the end (delta: -5.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 86.0MB. Free memory was 47.9MB in the beginning and 47.3MB in the end (delta: 536.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 108]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftRight at line 39, overapproximation of bitwiseOr at line 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 103, overapproximation of bitwiseAnd at line 90. Possible FailurePath: [L16] static const double huge_floor = 1.0e300; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L103] double x = -1.0 / 0.0; [L104] CALL, EXPR floor_double(x) [L19] __int32_t i0, i1, j0; [L20] __uint32_t i, j; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (i0) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (i1) = ew_u.parts.lsw [L27] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=-2, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L28] COND TRUE j0 < 20 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=-2, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L29] COND FALSE !(j0 < 0) [L39] i = (0x000fffff) >> j0 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=0, i0=-1048576, i1=-2, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L40] COND TRUE ((i0 & i) | i1) == 0 [L41] return x; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \result=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=0, i0=-1048576, i1=-2, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L104] RET, EXPR floor_double(x) [L104] double res = floor_double(x); [L107] CALL, EXPR isinf_double(res) [L83] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L85] ieee_double_shape_type ew_u; [L86] ew_u.value = (x) [L87] EXPR ew_u.parts.msw [L87] (hx) = ew_u.parts.msw [L88] EXPR ew_u.parts.lsw [L88] (lx) = ew_u.parts.lsw [L90] hx &= 0x7fffffff [L91] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L92] hx = 0x7ff00000 - hx [L93] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \result=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-2, lx=1, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L107] RET, EXPR isinf_double(res) [L107] COND TRUE !isinf_double(res) [L108] reach_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 51 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, 51 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=37occurred 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.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 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-07-21 01:47:48,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_1052b.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 e723e72a166ac6fb1b462e1c13b91930c5f4e10bc44198831987bd0b753e97c5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:47:49,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:47:49,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:47:49,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:47:49,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:47:49,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:47:49,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:47:49,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:47:49,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:47:49,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:47:49,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:47:49,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:47:49,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:47:49,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:47:49,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:47:49,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:47:49,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:47:49,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:47:49,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:47:49,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:47:49,899 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:47:49,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:47:49,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:47:49,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:47:49,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:47:49,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:47:49,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:47:49,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:47:49,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:47:49,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:47:49,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:47:49,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:47:49,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:47:49,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:47:49,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:47:49,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:47:49,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:47:49,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:47:49,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:47:49,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:47:49,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:47:49,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:47:49,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:47:49,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:47:49,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:47:49,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:47:49,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:47:49,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:47:49,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:47:49,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:47:49,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:47:49,964 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:47:49,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:47:49,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:47:49,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:47:49,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:47:49,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:47:49,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:47:49,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:47:49,965 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:47:49,965 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:47:49,965 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:47:49,966 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:47:49,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:47:49,966 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:47:49,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:47:49,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:47:49,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:47:49,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:47:49,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:47:49,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:47:49,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:47:49,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:47:49,967 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:47:49,967 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:47:49,968 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:47:49,968 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:47:49,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:47:49,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:47:49,968 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 -> e723e72a166ac6fb1b462e1c13b91930c5f4e10bc44198831987bd0b753e97c5 [2022-07-21 01:47:50,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:47:50,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:47:50,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:47:50,256 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:47:50,256 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:47:50,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052b.c [2022-07-21 01:47:50,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4f6dcf6/df9ca44eb8f14c7fa1bce2d5bcecc0cc/FLAG31fe25aff [2022-07-21 01:47:50,676 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:47:50,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052b.c [2022-07-21 01:47:50,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4f6dcf6/df9ca44eb8f14c7fa1bce2d5bcecc0cc/FLAG31fe25aff [2022-07-21 01:47:51,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4f6dcf6/df9ca44eb8f14c7fa1bce2d5bcecc0cc [2022-07-21 01:47:51,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:47:51,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:47:51,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:47:51,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:47:51,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:47:51,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb03cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51, skipping insertion in model container [2022-07-21 01:47:51,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:47:51,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:47:51,255 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_1052b.c[2416,2429] [2022-07-21 01:47:51,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:47:51,268 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:47:51,330 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_1052b.c[2416,2429] [2022-07-21 01:47:51,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:47:51,346 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:47:51,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51 WrapperNode [2022-07-21 01:47:51,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:47:51,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:47:51,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:47:51,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:47:51,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,387 INFO L137 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-07-21 01:47:51,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:47:51,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:47:51,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:47:51,392 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:47:51,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:47:51,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:47:51,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:47:51,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:47:51,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (1/1) ... [2022-07-21 01:47:51,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:47:51,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:47:51,484 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-07-21 01:47:51,485 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-07-21 01:47:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:47:51,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-21 01:47:51,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-21 01:47:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:47:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:47:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 01:47:51,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:47:51,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:47:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 01:47:51,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:47:51,594 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:47:51,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:47:52,782 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:47:52,787 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:47:52,787 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 01:47:52,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:47:52 BoogieIcfgContainer [2022-07-21 01:47:52,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:47:52,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:47:52,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:47:52,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:47:52,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:47:51" (1/3) ... [2022-07-21 01:47:52,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3e5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:47:52, skipping insertion in model container [2022-07-21 01:47:52,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:47:51" (2/3) ... [2022-07-21 01:47:52,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c3e5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:47:52, skipping insertion in model container [2022-07-21 01:47:52,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:47:52" (3/3) ... [2022-07-21 01:47:52,793 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052b.c [2022-07-21 01:47:52,803 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:47:52,804 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:47:52,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:47:52,835 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19cd2407, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a3fcc32 [2022-07-21 01:47:52,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:47:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 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-07-21 01:47:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 01:47:52,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:47:52,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:47:52,844 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:47:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:47:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash 658478814, now seen corresponding path program 1 times [2022-07-21 01:47:52,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:47:52,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422229795] [2022-07-21 01:47:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:47:52,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:47:52,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:47:52,867 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-07-21 01:47:52,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 01:47:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:47:52,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 01:47:52,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:47:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:47:52,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:47:52,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:47:52,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422229795] [2022-07-21 01:47:52,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422229795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:47:52,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:47:52,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:47:52,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306645113] [2022-07-21 01:47:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:47:52,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:47:52,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:47:53,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:47:53,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:47:53,006 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 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-07-21 01:47:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:47:53,016 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2022-07-21 01:47:53,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:47:53,025 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-07-21 01:47:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:47:53,030 INFO L225 Difference]: With dead ends: 72 [2022-07-21 01:47:53,030 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 01:47:53,032 INFO L412 NwaCegarLoop]: 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-07-21 01:47:53,035 INFO L413 NwaCegarLoop]: 51 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, 51 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-07-21 01:47:53,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:47:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 01:47:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-21 01:47:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:47:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-07-21 01:47:53,074 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 13 [2022-07-21 01:47:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:47:53,074 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-07-21 01:47:53,075 INFO L496 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-07-21 01:47:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-07-21 01:47:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 01:47:53,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:47:53,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:47:53,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 01:47:53,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:47:53,278 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:47:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:47:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1562173395, now seen corresponding path program 1 times [2022-07-21 01:47:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:47:53,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172528699] [2022-07-21 01:47:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:47:53,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:47:53,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:47:53,281 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-07-21 01:47:53,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 01:47:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:47:53,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 01:47:53,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:47:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:47:53,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:47:53,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:47:53,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172528699] [2022-07-21 01:47:53,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172528699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:47:53,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:47:53,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:47:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851016939] [2022-07-21 01:47:53,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:47:53,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:47:53,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:47:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:47:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:47:53,543 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-07-21 01:47:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:47:53,551 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-21 01:47:53,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:47:53,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-07-21 01:47:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:47:53,554 INFO L225 Difference]: With dead ends: 45 [2022-07-21 01:47:53,554 INFO L226 Difference]: Without dead ends: 26 [2022-07-21 01:47:53,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:47:53,556 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:47:53,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-21 01:47:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-21 01:47:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-21 01:47:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-07-21 01:47:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-21 01:47:53,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-07-21 01:47:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:47:53,567 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-21 01:47:53,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-07-21 01:47:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-21 01:47:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 01:47:53,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:47:53,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:47:53,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:47:53,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:47:53,778 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:47:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:47:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1129837443, now seen corresponding path program 1 times [2022-07-21 01:47:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:47:53,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766391888] [2022-07-21 01:47:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:47:53,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:47:53,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:47:53,782 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-07-21 01:47:53,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 01:47:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:47:53,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 01:47:53,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:47:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:47:54,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:47:54,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:47:54,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766391888] [2022-07-21 01:47:54,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766391888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:47:54,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:47:54,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 01:47:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209612743] [2022-07-21 01:47:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:47:54,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:47:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:47:54,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:47:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:47:54,029 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-07-21 01:47:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:47:54,034 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-21 01:47:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:47:54,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-07-21 01:47:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:47:54,035 INFO L225 Difference]: With dead ends: 34 [2022-07-21 01:47:54,035 INFO L226 Difference]: Without dead ends: 16 [2022-07-21 01:47:54,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:47:54,037 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:47:54,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-07-21 01:47:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-21 01:47:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-21 01:47:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-07-21 01:47:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-21 01:47:54,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2022-07-21 01:47:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:47:54,043 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-21 01:47:54,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-07-21 01:47:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-21 01:47:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 01:47:54,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:47:54,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:47:54,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 01:47:54,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:47:54,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:47:54,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:47:54,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1582346339, now seen corresponding path program 1 times [2022-07-21 01:47:54,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:47:54,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367587138] [2022-07-21 01:47:54,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:47:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:47:54,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:47:54,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:47:54,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 01:47:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:47:54,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 01:47:54,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:47:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:47:54,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:47:54,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:47:54,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367587138] [2022-07-21 01:47:54,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367587138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:47:54,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:47:54,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 01:47:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269435213] [2022-07-21 01:47:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:47:54,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 01:47:54,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:47:54,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 01:47:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:47:54,583 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-07-21 01:47:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:47:54,725 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-21 01:47:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 01:47:54,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-07-21 01:47:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:47:54,725 INFO L225 Difference]: With dead ends: 16 [2022-07-21 01:47:54,725 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 01:47:54,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-21 01:47:54,726 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:47:54,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-07-21 01:47:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 01:47:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 01:47:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-07-21 01:47:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 01:47:54,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-07-21 01:47:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:47:54,727 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 01:47:54,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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-07-21 01:47:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 01:47:54,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 01:47:54,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:47:54,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:47:54,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:47:54,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 01:47:54,993 INFO L895 garLoopResultBuilder]: At program point L93(lines 82 94) the Hoare annotation is: (exists ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_13|)) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse0 .cse0))) (= (bvadd (_ bv1 32) (bvneg (bvlshr (let ((.cse1 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvlshr (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_13|))) (bvor (bvneg .cse2) .cse2)) (_ bv31 32)) (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_13|))))))) (bvor (bvneg .cse1) .cse1)) (_ bv31 32)))) |ULTIMATE.start_isinf_double_#res#1|))) [2022-07-21 01:47:54,993 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2022-07-21 01:47:54,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 01:47:54,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 01:47:54,993 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 71) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L895 garLoopResultBuilder]: At program point L78(lines 18 79) the Hoare annotation is: (and (= (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start_floor_double_#res#1|) (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_floor_double_~x#1|)) [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 48) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_floor_double_~x#1|)) [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 26) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L902 garLoopResultBuilder]: At program point L112(lines 96 113) the Hoare annotation is: true [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 37) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 77) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 18 79) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L72-2(lines 72 77) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 36) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L64-2(lines 64 65) no Hoare annotation was computed. [2022-07-21 01:47:54,994 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 57) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 71) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 110) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 36) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 53) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 47) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 68) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 68) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 89) no Hoare annotation was computed. [2022-07-21 01:47:54,995 INFO L895 garLoopResultBuilder]: At program point L84-2(lines 84 89) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (= .cse0 |ULTIMATE.start_isinf_double_~x#1|) (= .cse0 |ULTIMATE.start_floor_double_#res#1|) (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)) |ULTIMATE.start_floor_double_~x#1|))) [2022-07-21 01:47:54,996 INFO L899 garLoopResultBuilder]: For program point L84-3(lines 84 89) no Hoare annotation was computed. [2022-07-21 01:47:54,996 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2022-07-21 01:47:54,996 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-07-21 01:47:54,998 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-21 01:47:54,999 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:47:55,010 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,013 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,014 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,014 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,015 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,019 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,019 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,019 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,020 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,020 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,021 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,021 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,021 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,021 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,023 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,025 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,027 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:47:55 BoogieIcfgContainer [2022-07-21 01:47:55,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:47:55,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:47:55,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:47:55,044 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:47:55,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:47:52" (3/4) ... [2022-07-21 01:47:55,047 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 01:47:55,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-21 01:47:55,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-21 01:47:55,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-21 01:47:55,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 01:47:55,079 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x [2022-07-21 01:47:55,080 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x && ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x [2022-07-21 01:47:55,081 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_skolemized_q#valueAsBitvector_13 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_13[63:63], v_skolemized_q#valueAsBitvector_13[62:52], v_skolemized_q#valueAsBitvector_13[51:0]) == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && ~bvadd64(1bv32, ~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), 31bv32))) == \result) [2022-07-21 01:47:55,100 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 01:47:55,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:47:55,101 INFO L158 Benchmark]: Toolchain (without parser) took 3990.89ms. Allocated memory was 52.4MB in the beginning and 83.9MB in the end (delta: 31.5MB). Free memory was 29.5MB in the beginning and 51.0MB in the end (delta: -21.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-07-21 01:47:55,101 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 34.8MB in the beginning and 34.8MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:47:55,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.52ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 29.3MB in the beginning and 51.0MB in the end (delta: -21.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2022-07-21 01:47:55,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.02ms. Allocated memory is still 69.2MB. Free memory was 51.0MB in the beginning and 49.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:47:55,102 INFO L158 Benchmark]: Boogie Preprocessor took 52.31ms. Allocated memory is still 69.2MB. Free memory was 49.2MB in the beginning and 47.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:47:55,102 INFO L158 Benchmark]: RCFGBuilder took 1343.91ms. Allocated memory is still 69.2MB. Free memory was 47.5MB in the beginning and 50.2MB in the end (delta: -2.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-07-21 01:47:55,102 INFO L158 Benchmark]: TraceAbstraction took 2253.43ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 49.7MB in the beginning and 54.0MB in the end (delta: -4.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-07-21 01:47:55,103 INFO L158 Benchmark]: Witness Printer took 57.04ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 51.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:47:55,104 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 34.8MB in the beginning and 34.8MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.52ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 29.3MB in the beginning and 51.0MB in the end (delta: -21.7MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.02ms. Allocated memory is still 69.2MB. Free memory was 51.0MB in the beginning and 49.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.31ms. Allocated memory is still 69.2MB. Free memory was 49.2MB in the beginning and 47.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1343.91ms. Allocated memory is still 69.2MB. Free memory was 47.5MB in the beginning and 50.2MB in the end (delta: -2.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2253.43ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 49.7MB in the beginning and 54.0MB in the end (delta: -4.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Witness Printer took 57.04ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 51.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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 - PositiveResult [Line: 108]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 218 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 98 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 21, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 161 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 13 QuantifiedInterpolants, 536 SizeOfPredicates, 26 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 82]: Loop Invariant [2022-07-21 01:47:55,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] [2022-07-21 01:47:55,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_13,QUANTIFIED] Derived loop invariant: (\exists v_skolemized_q#valueAsBitvector_13 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_13[63:63], v_skolemized_q#valueAsBitvector_13[62:52], v_skolemized_q#valueAsBitvector_13[51:0]) == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && ~bvadd64(1bv32, ~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_13[31:0]), v_skolemized_q#valueAsBitvector_13[31:0]), 31bv32), ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_13[63:32]))))), 31bv32))) == \result) - InvariantResult [Line: 84]: Loop Invariant [2022-07-21 01:47:55,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x && ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant [2022-07-21 01:47:55,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,138 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,139 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 21]: Loop Invariant [2022-07-21 01:47:55,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-21 01:47:55,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x RESULT: Ultimate proved your program to be correct! [2022-07-21 01:47:55,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE