./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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-benchs/sqrt_poly.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 e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ....................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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-benchs/sqrt_poly.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 e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 00:59:18,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 00:59:18,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 00:59:18,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 00:59:18,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 00:59:18,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 00:59:18,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 00:59:18,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 00:59:18,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 00:59:18,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 00:59:18,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 00:59:18,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 00:59:18,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 00:59:18,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 00:59:18,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 00:59:18,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 00:59:18,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 00:59:18,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 00:59:18,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 00:59:18,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 00:59:18,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 00:59:18,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 00:59:18,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 00:59:18,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 00:59:18,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 00:59:18,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 00:59:18,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 00:59:18,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 00:59:18,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 00:59:18,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 00:59:18,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 00:59:18,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 00:59:18,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 00:59:18,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 00:59:18,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 00:59:18,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 00:59:18,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 00:59:18,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 00:59:18,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 00:59:18,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 00:59:18,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 00:59:18,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 00:59:18,993 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 00:59:18,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 00:59:18,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 00:59:18,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 00:59:18,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 00:59:18,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 00:59:18,995 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 00:59:18,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 00:59:18,996 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 00:59:18,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 00:59:18,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 00:59:18,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 00:59:18,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 00:59:18,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 00:59:18,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 00:59:18,997 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 00:59:18,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 00:59:18,998 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 00:59:18,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 00:59:18,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 00:59:18,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 00:59:18,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 00:59:18,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 00:59:18,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 00:59:18,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 00:59:18,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 00:59:18,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 00:59:18,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 00:59:18,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 00:59:18,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 00:59:19,000 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 -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2021-08-26 00:59:19,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 00:59:19,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 00:59:19,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 00:59:19,254 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 00:59:19,255 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 00:59:19,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-08-26 00:59:19,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855c3606a/e1b423e953274f04a0afdf71375080ba/FLAG18981083d [2021-08-26 00:59:19,584 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 00:59:19,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-08-26 00:59:19,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855c3606a/e1b423e953274f04a0afdf71375080ba/FLAG18981083d [2021-08-26 00:59:20,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855c3606a/e1b423e953274f04a0afdf71375080ba [2021-08-26 00:59:20,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 00:59:20,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 00:59:20,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 00:59:20,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 00:59:20,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 00:59:20,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d3c34d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20, skipping insertion in model container [2021-08-26 00:59:20,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 00:59:20,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 00:59:20,175 WARN L228 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-benchs/sqrt_poly.c[671,684] [2021-08-26 00:59:20,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 00:59:20,197 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 00:59:20,205 WARN L228 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-benchs/sqrt_poly.c[671,684] [2021-08-26 00:59:20,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 00:59:20,223 INFO L208 MainTranslator]: Completed translation [2021-08-26 00:59:20,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20 WrapperNode [2021-08-26 00:59:20,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 00:59:20,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 00:59:20,228 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 00:59:20,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 00:59:20,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 00:59:20,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 00:59:20,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 00:59:20,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 00:59:20,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 00:59:20,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 00:59:20,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 00:59:20,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 00:59:20,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (1/1) ... [2021-08-26 00:59:20,289 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 00:59:20,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 00:59:20,302 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) [2021-08-26 00:59:20,315 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 [2021-08-26 00:59:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 00:59:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 00:59:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 00:59:20,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 00:59:20,476 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 00:59:20,476 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-26 00:59:20,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:59:20 BoogieIcfgContainer [2021-08-26 00:59:20,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 00:59:20,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 00:59:20,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 00:59:20,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 00:59:20,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:59:20" (1/3) ... [2021-08-26 00:59:20,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc48e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:59:20, skipping insertion in model container [2021-08-26 00:59:20,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:20" (2/3) ... [2021-08-26 00:59:20,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc48e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:59:20, skipping insertion in model container [2021-08-26 00:59:20,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:59:20" (3/3) ... [2021-08-26 00:59:20,483 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-08-26 00:59:20,486 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 00:59:20,486 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 00:59:20,511 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 00:59:20,515 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 00:59:20,515 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 00:59:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 00:59:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-26 00:59:20,526 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 00:59:20,526 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-26 00:59:20,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 00:59:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 00:59:20,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-08-26 00:59:20,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 00:59:20,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159235459] [2021-08-26 00:59:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 00:59:20,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 00:59:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 00:59:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 00:59:20,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 00:59:20,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159235459] [2021-08-26 00:59:20,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159235459] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 00:59:20,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 00:59:20,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 00:59:20,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035898496] [2021-08-26 00:59:20,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 00:59:20,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 00:59:20,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 00:59:20,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 00:59:20,636 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-08-26 00:59:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 00:59:20,658 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-08-26 00:59:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 00:59:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2021-08-26 00:59:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 00:59:20,663 INFO L225 Difference]: With dead ends: 21 [2021-08-26 00:59:20,663 INFO L226 Difference]: Without dead ends: 8 [2021-08-26 00:59:20,665 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 00:59:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-08-26 00:59:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-08-26 00:59:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2021-08-26 00:59:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-08-26 00:59:20,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-08-26 00:59:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 00:59:20,681 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-08-26 00:59:20,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-08-26 00:59:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-08-26 00:59:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-26 00:59:20,681 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 00:59:20,682 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-26 00:59:20,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 00:59:20,682 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 00:59:20,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 00:59:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-08-26 00:59:20,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 00:59:20,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51269623] [2021-08-26 00:59:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 00:59:20,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 00:59:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 00:59:20,700 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 00:59:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 00:59:20,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 00:59:20,720 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 00:59:20,721 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 00:59:20,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 00:59:20,726 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 00:59:20,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:59:20 BoogieIcfgContainer [2021-08-26 00:59:20,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 00:59:20,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 00:59:20,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 00:59:20,739 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 00:59:20,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:59:20" (3/4) ... [2021-08-26 00:59:20,741 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 00:59:20,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 00:59:20,742 INFO L168 Benchmark]: Toolchain (without parser) took 718.66 ms. Allocated memory was 48.2 MB in the beginning and 67.1 MB in the end (delta: 18.9 MB). Free memory was 24.4 MB in the beginning and 41.1 MB in the end (delta: -16.7 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-08-26 00:59:20,743 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 48.2 MB. Free memory was 30.6 MB in the beginning and 30.5 MB in the end (delta: 51.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 00:59:20,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.34 ms. Allocated memory was 48.2 MB in the beginning and 67.1 MB in the end (delta: 18.9 MB). Free memory was 24.2 MB in the beginning and 44.6 MB in the end (delta: -20.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-08-26 00:59:20,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.98 ms. Allocated memory is still 67.1 MB. Free memory was 44.6 MB in the beginning and 43.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 00:59:20,744 INFO L168 Benchmark]: Boogie Preprocessor took 11.48 ms. Allocated memory is still 67.1 MB. Free memory was 43.1 MB in the beginning and 42.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 00:59:20,744 INFO L168 Benchmark]: RCFGBuilder took 194.40 ms. Allocated memory is still 67.1 MB. Free memory was 42.0 MB in the beginning and 45.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 00:59:20,745 INFO L168 Benchmark]: TraceAbstraction took 259.18 ms. Allocated memory is still 67.1 MB. Free memory was 45.2 MB in the beginning and 41.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2021-08-26 00:59:20,745 INFO L168 Benchmark]: Witness Printer took 2.62 ms. Allocated memory is still 67.1 MB. Free memory was 41.4 MB in the beginning and 41.1 MB in the end (delta: 293.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 00:59:20,747 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.13 ms. Allocated memory is still 48.2 MB. Free memory was 30.6 MB in the beginning and 30.5 MB in the end (delta: 51.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 203.34 ms. Allocated memory was 48.2 MB in the beginning and 67.1 MB in the end (delta: 18.9 MB). Free memory was 24.2 MB in the beginning and 44.6 MB in the end (delta: -20.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.98 ms. Allocated memory is still 67.1 MB. Free memory was 44.6 MB in the beginning and 43.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 11.48 ms. Allocated memory is still 67.1 MB. Free memory was 43.1 MB in the beginning and 42.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 194.40 ms. Allocated memory is still 67.1 MB. Free memory was 42.0 MB in the beginning and 45.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 259.18 ms. Allocated memory is still 67.1 MB. Free memory was 45.2 MB in the beginning and 41.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Witness Printer took 2.62 ms. Allocated memory is still 67.1 MB. Free memory was 41.4 MB in the beginning and 41.1 MB in the end (delta: 293.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L14] COND FALSE !(!cond) VAL [sqrt2=11863283/8388608] [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L16] reach_error() VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 215.3ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 5.6ms, AutomataDifference: 37.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred 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.0ms DumpTime, AutomataMinimizationStatistics: 7.4ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.6ms SsaConstructionTime, 27.9ms SatisfiabilityAnalysisTime, 30.0ms InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 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 [2021-08-26 00:59:20,772 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 00:59:22,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 00:59:22,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 00:59:22,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 00:59:22,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 00:59:22,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 00:59:22,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 00:59:22,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 00:59:22,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 00:59:22,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 00:59:22,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 00:59:22,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 00:59:22,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 00:59:22,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 00:59:22,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 00:59:22,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 00:59:22,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 00:59:22,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 00:59:22,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 00:59:22,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 00:59:22,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 00:59:22,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 00:59:22,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 00:59:22,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 00:59:22,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 00:59:22,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 00:59:22,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 00:59:22,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 00:59:22,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 00:59:22,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 00:59:22,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 00:59:22,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 00:59:22,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 00:59:22,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 00:59:22,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 00:59:22,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 00:59:22,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 00:59:22,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 00:59:22,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 00:59:22,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 00:59:22,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 00:59:22,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 00:59:22,741 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 00:59:22,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 00:59:22,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 00:59:22,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 00:59:22,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 00:59:22,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 00:59:22,744 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 00:59:22,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 00:59:22,744 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 00:59:22,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 00:59:22,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 00:59:22,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 00:59:22,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 00:59:22,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 00:59:22,745 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 00:59:22,745 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 00:59:22,746 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 00:59:22,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 00:59:22,746 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 00:59:22,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 00:59:22,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 00:59:22,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 00:59:22,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 00:59:22,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 00:59:22,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 00:59:22,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 00:59:22,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 00:59:22,755 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 00:59:22,755 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 00:59:22,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 00:59:22,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 00:59:22,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 00:59:22,756 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 -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2021-08-26 00:59:23,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 00:59:23,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 00:59:23,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 00:59:23,022 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 00:59:23,023 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 00:59:23,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-08-26 00:59:23,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a179c19/72402540f0874d57acecc90ff48a4c46/FLAGb7bea2057 [2021-08-26 00:59:23,412 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 00:59:23,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-08-26 00:59:23,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a179c19/72402540f0874d57acecc90ff48a4c46/FLAGb7bea2057 [2021-08-26 00:59:23,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5a179c19/72402540f0874d57acecc90ff48a4c46 [2021-08-26 00:59:23,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 00:59:23,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 00:59:23,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 00:59:23,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 00:59:23,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 00:59:23,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236a275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23, skipping insertion in model container [2021-08-26 00:59:23,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 00:59:23,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 00:59:23,573 WARN L228 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-benchs/sqrt_poly.c[671,684] [2021-08-26 00:59:23,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 00:59:23,599 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 00:59:23,608 WARN L228 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-benchs/sqrt_poly.c[671,684] [2021-08-26 00:59:23,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 00:59:23,638 INFO L208 MainTranslator]: Completed translation [2021-08-26 00:59:23,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23 WrapperNode [2021-08-26 00:59:23,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 00:59:23,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 00:59:23,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 00:59:23,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 00:59:23,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 00:59:23,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 00:59:23,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 00:59:23,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 00:59:23,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 00:59:23,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 00:59:23,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 00:59:23,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 00:59:23,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (1/1) ... [2021-08-26 00:59:23,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 00:59:23,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 00:59:23,777 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) [2021-08-26 00:59:23,841 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 [2021-08-26 00:59:23,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 00:59:23,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 00:59:23,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 00:59:23,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 00:59:28,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 00:59:28,395 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-26 00:59:28,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:59:28 BoogieIcfgContainer [2021-08-26 00:59:28,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 00:59:28,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 00:59:28,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 00:59:28,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 00:59:28,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:59:23" (1/3) ... [2021-08-26 00:59:28,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec542f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:59:28, skipping insertion in model container [2021-08-26 00:59:28,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:59:23" (2/3) ... [2021-08-26 00:59:28,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec542f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:59:28, skipping insertion in model container [2021-08-26 00:59:28,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:59:28" (3/3) ... [2021-08-26 00:59:28,403 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-08-26 00:59:28,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 00:59:28,406 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 00:59:28,437 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 00:59:28,441 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 00:59:28,441 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 00:59:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 00:59:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-26 00:59:28,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 00:59:28,452 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-26 00:59:28,452 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 00:59:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 00:59:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-08-26 00:59:28,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 00:59:28,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489487723] [2021-08-26 00:59:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 00:59:28,464 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 00:59:28,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 00:59:28,466 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) [2021-08-26 00:59:28,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 00:59:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 00:59:29,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 00:59:29,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 00:59:29,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 00:59:29,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 00:59:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 00:59:29,226 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 00:59:29,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489487723] [2021-08-26 00:59:29,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489487723] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 00:59:29,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 00:59:29,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 00:59:29,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975464221] [2021-08-26 00:59:29,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 00:59:29,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 00:59:29,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 00:59:29,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 00:59:29,247 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-08-26 00:59:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 00:59:29,255 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-08-26 00:59:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 00:59:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2021-08-26 00:59:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 00:59:29,261 INFO L225 Difference]: With dead ends: 21 [2021-08-26 00:59:29,261 INFO L226 Difference]: Without dead ends: 8 [2021-08-26 00:59:29,263 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 00:59:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-08-26 00:59:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-08-26 00:59:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2021-08-26 00:59:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-08-26 00:59:29,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-08-26 00:59:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 00:59:29,279 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-08-26 00:59:29,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2021-08-26 00:59:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-08-26 00:59:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-26 00:59:29,280 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 00:59:29,281 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-26 00:59:29,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-26 00:59:29,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 00:59:29,499 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 00:59:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 00:59:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-08-26 00:59:29,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 00:59:29,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86025095] [2021-08-26 00:59:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 00:59:29,505 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 00:59:29,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 00:59:29,506 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) [2021-08-26 00:59:29,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 00:59:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 00:59:30,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 00:59:30,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 00:59:47,600 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))) c_ULTIMATE.start_main_~S~0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:01:35,268 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) is different from false [2021-08-26 01:01:37,352 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) is different from true [2021-08-26 01:02:29,797 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq .cse0 .cse2))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2021-08-26 01:02:31,886 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq .cse0 .cse2))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2021-08-26 01:02:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:02:31,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:02:48,069 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-08-26 01:02:50,220 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-08-26 01:03:10,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-08-26 01:03:12,844 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-08-26 01:04:07,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) is different from false [2021-08-26 01:04:10,100 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) is different from true [2021-08-26 01:04:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:04:10,101 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:04:10,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86025095] [2021-08-26 01:04:10,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86025095] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:04:10,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:04:10,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-08-26 01:04:10,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51730744] [2021-08-26 01:04:10,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 01:04:10,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:04:10,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 01:04:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-08-26 01:04:10,104 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:04:12,242 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:04:14,428 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:04:16,569 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from false [2021-08-26 01:04:18,715 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from true [2021-08-26 01:04:20,846 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from false [2021-08-26 01:04:22,999 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from true [2021-08-26 01:04:25,137 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))) c_ULTIMATE.start_main_~S~0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:04:27,295 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-08-26 01:04:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:04:27,358 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2021-08-26 01:04:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:04:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-08-26 01:04:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:04:27,359 INFO L225 Difference]: With dead ends: 12 [2021-08-26 01:04:27,359 INFO L226 Difference]: Without dead ends: 8 [2021-08-26 01:04:27,360 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41269.9ms TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-08-26 01:04:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-08-26 01:04:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-08-26 01:04:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2021-08-26 01:04:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2021-08-26 01:04:27,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2021-08-26 01:04:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:04:27,361 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2021-08-26 01:04:27,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:04:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2021-08-26 01:04:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-26 01:04:27,361 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:04:27,362 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:04:27,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:04:27,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:04:27,571 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:04:27,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:04:27,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2021-08-26 01:04:27,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:04:27,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340586802] [2021-08-26 01:04:27,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:04:27,573 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:04:27,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:04:27,574 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) [2021-08-26 01:04:27,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:04:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:04:38,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 01:04:38,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:04:55,012 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:06:43,946 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) is different from false [2021-08-26 01:06:46,038 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) is different from true [2021-08-26 01:07:38,676 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2021-08-26 01:07:40,772 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2021-08-26 01:07:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:07:40,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:07:56,569 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-08-26 01:07:58,721 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-08-26 01:08:18,689 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from false [2021-08-26 01:08:20,848 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from true [2021-08-26 01:09:14,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) is different from false [2021-08-26 01:09:16,995 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) is different from true [2021-08-26 01:09:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:09:16,996 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:09:16,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340586802] [2021-08-26 01:09:16,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340586802] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:09:16,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:09:16,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-08-26 01:09:16,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411583740] [2021-08-26 01:09:16,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 01:09:16,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:09:16,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 01:09:16,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-08-26 01:09:16,998 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:09:19,150 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:09:21,305 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:09:23,471 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from false [2021-08-26 01:09:25,630 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from true [2021-08-26 01:09:27,795 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-08-26 01:09:29,958 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:09:32,117 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:09:34,291 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4))))) is different from false [2021-08-26 01:09:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:09:34,305 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2021-08-26 01:09:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:09:34,305 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-08-26 01:09:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:09:34,305 INFO L225 Difference]: With dead ends: 8 [2021-08-26 01:09:34,305 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:09:34,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41412.1ms TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-08-26 01:09:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:09:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:09:34,306 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) [2021-08-26 01:09:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:09:34,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2021-08-26 01:09:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:09:34,306 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:09:34,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:09:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:09:34,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:09:34,308 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:09:34,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 01:09:34,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:09:34,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:09:34,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:09:34,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:09:34,578 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 01:09:34,578 INFO L860 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-08-26 01:09:34,579 INFO L857 garLoopResultBuilder]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2021-08-26 01:09:34,579 INFO L857 garLoopResultBuilder]: For program point L13(lines 27 28) no Hoare annotation was computed. [2021-08-26 01:09:34,579 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 01:09:34,579 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 01:09:34,579 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 01:09:34,579 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-08-26 01:09:34,580 INFO L857 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-08-26 01:09:34,580 INFO L857 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-08-26 01:09:34,580 INFO L857 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-08-26 01:09:34,580 INFO L860 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-08-26 01:09:34,583 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:09:34,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:09:34 BoogieIcfgContainer [2021-08-26 01:09:34,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:09:34,589 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:09:34,589 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:09:34,589 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:09:34,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:59:28" (3/4) ... [2021-08-26 01:09:34,592 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 01:09:34,599 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-08-26 01:09:34,599 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-26 01:09:34,599 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:09:34,599 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:09:34,625 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 01:09:34,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:09:34,626 INFO L168 Benchmark]: Toolchain (without parser) took 611192.24 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 35.7 MB in the beginning and 36.1 MB in the end (delta: -400.4 kB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:09:34,627 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 38.9 MB in the end (delta: 43.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:09:34,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.82 ms. Allocated memory is still 56.6 MB. Free memory was 35.5 MB in the beginning and 40.4 MB in the end (delta: -4.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:09:34,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.41 ms. Allocated memory is still 56.6 MB. Free memory was 40.4 MB in the beginning and 38.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:09:34,631 INFO L168 Benchmark]: Boogie Preprocessor took 33.71 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 37.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:09:34,631 INFO L168 Benchmark]: RCFGBuilder took 4672.53 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 37.6 MB in the beginning and 57.7 MB in the end (delta: -20.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2021-08-26 01:09:34,632 INFO L168 Benchmark]: TraceAbstraction took 606189.95 ms. Allocated memory is still 75.5 MB. Free memory was 57.1 MB in the beginning and 38.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. [2021-08-26 01:09:34,632 INFO L168 Benchmark]: Witness Printer took 36.67 ms. Allocated memory is still 75.5 MB. Free memory was 38.2 MB in the beginning and 36.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:09:34,635 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.13 ms. Allocated memory is still 56.6 MB. Free memory was 39.0 MB in the beginning and 38.9 MB in the end (delta: 43.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 204.82 ms. Allocated memory is still 56.6 MB. Free memory was 35.5 MB in the beginning and 40.4 MB in the end (delta: -4.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.41 ms. Allocated memory is still 56.6 MB. Free memory was 40.4 MB in the beginning and 38.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.71 ms. Allocated memory is still 56.6 MB. Free memory was 38.8 MB in the beginning and 37.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4672.53 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 37.6 MB in the beginning and 57.7 MB in the end (delta: -20.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 606189.95 ms. Allocated memory is still 75.5 MB. Free memory was 57.1 MB in the beginning and 38.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. * Witness Printer took 36.67 ms. Allocated memory is still 75.5 MB. Free memory was 38.2 MB in the beginning and 36.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 606147.3ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 5.8ms, AutomataDifference: 34595.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 55.1ms, InitialAbstractionConstructionTime: 5.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 11 SDs, 0 SdLazy, 11 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 130.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82682.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 9.9ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 48.5ms HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 2.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 37.8ms SsaConstructionTime, 12386.8ms SatisfiabilityAnalysisTime, 558208.3ms InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 1563 SizeOfPredicates, 15 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-08-26 01:09:34,856 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-26 01:09:34,899 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 137 Received shutdown request...