./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/digits_while.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/digits_while.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 4eb7ec87e4b26eecb67fe680444df008acb1d5ac2a26461a17b628d29f2e5ff2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:28:00,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:28:00,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:28:00,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:28:00,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:28:00,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:28:00,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:28:00,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:28:00,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:28:00,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:28:00,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:28:00,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:28:00,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:28:00,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:28:00,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:28:00,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:28:00,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:28:00,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:28:00,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:28:00,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:28:00,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:28:00,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:28:00,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:28:00,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:28:00,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:28:00,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:28:00,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:28:00,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:28:00,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:28:00,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:28:00,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:28:00,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:28:00,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:28:00,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:28:00,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:28:00,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:28:00,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:28:00,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:28:00,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:28:00,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:28:00,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:28:00,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:28:00,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:28:00,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:28:00,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:28:00,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:28:00,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:28:00,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:28:00,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:28:00,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:28:00,435 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:28:00,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:28:00,436 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:28:00,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:28:00,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:28:00,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:28:00,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:28:00,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:28:00,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:28:00,437 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:28:00,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:28:00,437 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:28:00,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:28:00,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:28:00,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:28:00,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:28:00,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:28:00,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:28:00,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:28:00,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:28:00,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:28:00,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:28:00,441 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:28:00,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:28:00,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:28:00,441 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 -> 4eb7ec87e4b26eecb67fe680444df008acb1d5ac2a26461a17b628d29f2e5ff2 [2022-02-20 16:28:00,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:28:00,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:28:00,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:28:00,729 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:28:00,729 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:28:00,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/digits_while.c [2022-02-20 16:28:00,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3770d408f/dbc6a28b52f448e5b61f0a27009b63e8/FLAG7ffbcf73c [2022-02-20 16:28:01,247 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:28:01,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_while.c [2022-02-20 16:28:01,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3770d408f/dbc6a28b52f448e5b61f0a27009b63e8/FLAG7ffbcf73c [2022-02-20 16:28:01,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3770d408f/dbc6a28b52f448e5b61f0a27009b63e8 [2022-02-20 16:28:01,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:28:01,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:28:01,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:28:01,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:28:01,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:28:01,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce0af83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01, skipping insertion in model container [2022-02-20 16:28:01,288 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:28:01,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:28:01,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_while.c[317,330] [2022-02-20 16:28:01,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:28:01,460 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:28:01,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_while.c[317,330] [2022-02-20 16:28:01,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:28:01,486 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:28:01,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01 WrapperNode [2022-02-20 16:28:01,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:28:01,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:28:01,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:28:01,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:28:01,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,514 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2022-02-20 16:28:01,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:28:01,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:28:01,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:28:01,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:28:01,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:28:01,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:28:01,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:28:01,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:28:01,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (1/1) ... [2022-02-20 16:28:01,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:28:01,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:28:01,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:28:01,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:28:01,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:28:01,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:28:01,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:28:01,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:28:01,633 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:28:01,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:28:01,778 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:28:01,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:28:01,785 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:28:01,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:28:01 BoogieIcfgContainer [2022-02-20 16:28:01,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:28:01,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:28:01,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:28:01,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:28:01,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:28:01" (1/3) ... [2022-02-20 16:28:01,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8cc167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:28:01, skipping insertion in model container [2022-02-20 16:28:01,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:01" (2/3) ... [2022-02-20 16:28:01,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8cc167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:28:01, skipping insertion in model container [2022-02-20 16:28:01,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:28:01" (3/3) ... [2022-02-20 16:28:01,802 INFO L111 eAbstractionObserver]: Analyzing ICFG digits_while.c [2022-02-20 16:28:01,808 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:28:01,808 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:28:01,861 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:28:01,869 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:28:01,870 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:28:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:28:01,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:28:01,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:28:01,891 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:28:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:28:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-02-20 16:28:01,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:28:01,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667306701] [2022-02-20 16:28:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:28:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:28:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:28:02,001 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:28:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:28:02,038 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:28:02,040 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:28:02,041 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:28:02,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:28:02,047 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-02-20 16:28:02,049 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:28:02,077 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:28:02,077 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:28:02,077 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 16:28:02,077 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 16:28:02,077 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 16:28:02,078 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-02-20 16:28:02,078 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-02-20 16:28:02,078 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2022-02-20 16:28:02,078 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-02-20 16:28:02,079 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2022-02-20 16:28:02,079 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2022-02-20 16:28:02,079 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:28:02,080 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:28:02,080 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:28:02,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:28:02 BoogieIcfgContainer [2022-02-20 16:28:02,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:28:02,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:28:02,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:28:02,084 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:28:02,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:28:01" (3/4) ... [2022-02-20 16:28:02,088 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:28:02,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:28:02,090 INFO L158 Benchmark]: Toolchain (without parser) took 814.40ms. Allocated memory is still 107.0MB. Free memory was 74.0MB in the beginning and 54.8MB in the end (delta: 19.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-02-20 16:28:02,091 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:28:02,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.86ms. Allocated memory is still 107.0MB. Free memory was 73.8MB in the beginning and 81.3MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:28:02,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 107.0MB. Free memory was 81.0MB in the beginning and 79.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:28:02,093 INFO L158 Benchmark]: Boogie Preprocessor took 17.17ms. Allocated memory is still 107.0MB. Free memory was 79.5MB in the beginning and 78.5MB in the end (delta: 967.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:28:02,094 INFO L158 Benchmark]: RCFGBuilder took 253.44ms. Allocated memory is still 107.0MB. Free memory was 78.5MB in the beginning and 69.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:28:02,095 INFO L158 Benchmark]: TraceAbstraction took 293.57ms. Allocated memory is still 107.0MB. Free memory was 68.8MB in the beginning and 55.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:28:02,096 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 107.0MB. Free memory was 55.1MB in the beginning and 54.8MB in the end (delta: 345.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:28:02,103 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.86ms. Allocated memory is still 107.0MB. Free memory was 73.8MB in the beginning and 81.3MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 107.0MB. Free memory was 81.0MB in the beginning and 79.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.17ms. Allocated memory is still 107.0MB. Free memory was 79.5MB in the beginning and 78.5MB in the end (delta: 967.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 253.44ms. Allocated memory is still 107.0MB. Free memory was 78.5MB in the beginning and 69.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 293.57ms. Allocated memory is still 107.0MB. Free memory was 68.8MB in the beginning and 55.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 107.0MB. Free memory was 55.1MB in the beginning and 54.8MB in the end (delta: 345.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryLONGDOUBLEComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L8] long double x = 1.0/7.0; [L9] long long res = 0; [L11] int i = 1; VAL [i=1, res=0] [L12] COND FALSE !(x != 0) VAL [i=1, res=0] [L19] CALL __VERIFIER_assert(res == 67050) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:28:02,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/digits_while.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 4eb7ec87e4b26eecb67fe680444df008acb1d5ac2a26461a17b628d29f2e5ff2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:28:04,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:28:04,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:28:04,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:28:04,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:28:04,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:28:04,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:28:04,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:28:04,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:28:04,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:28:04,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:28:04,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:28:04,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:28:04,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:28:04,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:28:04,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:28:04,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:28:04,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:28:04,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:28:04,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:28:04,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:28:04,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:28:04,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:28:04,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:28:04,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:28:04,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:28:04,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:28:04,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:28:04,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:28:04,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:28:04,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:28:04,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:28:04,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:28:04,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:28:04,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:28:04,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:28:04,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:28:04,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:28:04,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:28:04,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:28:04,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:28:04,109 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:28:04,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:28:04,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:28:04,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:28:04,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:28:04,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:28:04,130 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:28:04,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:28:04,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:28:04,131 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:28:04,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:28:04,131 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:28:04,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:28:04,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:28:04,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:28:04,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:28:04,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:28:04,133 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:28:04,133 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:28:04,133 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:28:04,133 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:28:04,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:28:04,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:28:04,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:28:04,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:28:04,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:28:04,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:28:04,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:28:04,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:28:04,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:28:04,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:28:04,144 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:28:04,144 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:28:04,144 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:28:04,144 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:28:04,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:28:04,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:28:04,145 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 -> 4eb7ec87e4b26eecb67fe680444df008acb1d5ac2a26461a17b628d29f2e5ff2 [2022-02-20 16:28:04,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:28:04,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:28:04,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:28:04,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:28:04,442 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:28:04,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/digits_while.c [2022-02-20 16:28:04,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55086a6a6/2fb8420bbbca4d3e83b41d58f6a93b94/FLAG5500198f3 [2022-02-20 16:28:04,959 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:28:04,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_while.c [2022-02-20 16:28:04,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55086a6a6/2fb8420bbbca4d3e83b41d58f6a93b94/FLAG5500198f3 [2022-02-20 16:28:04,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55086a6a6/2fb8420bbbca4d3e83b41d58f6a93b94 [2022-02-20 16:28:04,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:28:04,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:28:04,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:28:04,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:28:04,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:28:04,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:28:04" (1/1) ... [2022-02-20 16:28:04,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439f989b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:04, skipping insertion in model container [2022-02-20 16:28:04,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:28:04" (1/1) ... [2022-02-20 16:28:05,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:28:05,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:28:05,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_while.c[317,330] [2022-02-20 16:28:05,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:28:05,169 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:28:05,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_while.c[317,330] [2022-02-20 16:28:05,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:28:05,223 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:28:05,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05 WrapperNode [2022-02-20 16:28:05,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:28:05,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:28:05,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:28:05,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:28:05,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,257 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-02-20 16:28:05,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:28:05,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:28:05,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:28:05,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:28:05,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:28:05,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:28:05,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:28:05,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:28:05,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (1/1) ... [2022-02-20 16:28:05,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:28:05,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:28:05,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:28:05,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:28:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:28:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:28:05,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:28:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:28:05,392 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:28:05,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:28:07,641 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:28:07,646 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:28:07,646 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:28:07,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:28:07 BoogieIcfgContainer [2022-02-20 16:28:07,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:28:07,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:28:07,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:28:07,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:28:07,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:28:04" (1/3) ... [2022-02-20 16:28:07,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a97eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:28:07, skipping insertion in model container [2022-02-20 16:28:07,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:28:05" (2/3) ... [2022-02-20 16:28:07,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a97eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:28:07, skipping insertion in model container [2022-02-20 16:28:07,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:28:07" (3/3) ... [2022-02-20 16:28:07,655 INFO L111 eAbstractionObserver]: Analyzing ICFG digits_while.c [2022-02-20 16:28:07,671 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:28:07,672 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:28:07,711 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:28:07,718 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:28:07,718 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:28:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:28:07,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:28:07,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:28:07,743 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:28:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:28:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-02-20 16:28:07,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:28:07,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059260503] [2022-02-20 16:28:07,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:28:07,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:28:07,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:28:07,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:28:07,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:28:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:28:07,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:28:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:28:07,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:28:08,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {14#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {14#true} is VALID [2022-02-20 16:28:08,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {14#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~res~0#1, main_~i~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {22#(= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))))} is VALID [2022-02-20 16:28:08,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#(= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {15#false} is VALID [2022-02-20 16:28:08,070 INFO L290 TraceCheckUtils]: 3: Hoare triple {15#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 67050bv64 == main_~res~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {15#false} is VALID [2022-02-20 16:28:08,070 INFO L290 TraceCheckUtils]: 4: Hoare triple {15#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {15#false} is VALID [2022-02-20 16:28:08,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {15#false} assume !false; {15#false} is VALID [2022-02-20 16:28:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:28:08,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:28:08,072 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:28:08,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059260503] [2022-02-20 16:28:08,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059260503] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:28:08,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:28:08,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:28:08,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775181154] [2022-02-20 16:28:08,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:28:08,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 16:28:08,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:28:08,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:08,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:28:08,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:28:08,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:28:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:28:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:28:08,121 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:10,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:28:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:10,526 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-20 16:28:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:28:10,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 16:28:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:28:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 16:28:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 16:28:10,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-20 16:28:11,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:28:11,069 INFO L225 Difference]: With dead ends: 20 [2022-02-20 16:28:11,069 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 16:28:11,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:28:11,074 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:28:11,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 16:28:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 16:28:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 16:28:11,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:28:11,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second 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) [2022-02-20 16:28:11,100 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second 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) [2022-02-20 16:28:11,100 INFO L87 Difference]: Start difference. First operand 8 states. Second 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) [2022-02-20 16:28:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:11,103 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 16:28:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:28:11,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:28:11,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:28:11,104 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 8 states. [2022-02-20 16:28:11,104 INFO L87 Difference]: Start difference. First 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) Second operand 8 states. [2022-02-20 16:28:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:11,105 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 16:28:11,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:28:11,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:28:11,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:28:11,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:28:11,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:28:11,107 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) [2022-02-20 16:28:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 16:28:11,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-02-20 16:28:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:28:11,112 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 16:28:11,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 16:28:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:28:11,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:28:11,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:28:11,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:28:11,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:28:11,326 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:28:11,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:28:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-02-20 16:28:11,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:28:11,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716135694] [2022-02-20 16:28:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:28:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:28:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:28:11,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:28:11,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:28:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:28:11,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:28:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:28:11,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:28:13,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {91#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:28:13,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {91#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~res~0#1, main_~i~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {95#(and (= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:13,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#(and (= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (= currentRoundingMode roundNearestTiesToEven))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1))));main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {99#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:13,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {99#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {87#false} is VALID [2022-02-20 16:28:13,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {87#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 67050bv64 == main_~res~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {87#false} is VALID [2022-02-20 16:28:13,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {87#false} is VALID [2022-02-20 16:28:13,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#false} assume !false; {87#false} is VALID [2022-02-20 16:28:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:28:13,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:28:19,597 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-02-20 16:28:21,657 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-02-20 16:28:21,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#false} assume !false; {87#false} is VALID [2022-02-20 16:28:21,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {87#false} is VALID [2022-02-20 16:28:21,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {87#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 67050bv64 == main_~res~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {87#false} is VALID [2022-02-20 16:28:21,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(not (fp.eq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {87#false} is VALID [2022-02-20 16:28:21,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1))));main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {121#(not (fp.eq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is VALID [2022-02-20 16:28:23,912 WARN L290 TraceCheckUtils]: 1: Hoare triple {86#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~res~0#1, main_~i~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {125#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is UNKNOWN [2022-02-20 16:28:23,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {86#true} is VALID [2022-02-20 16:28:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-20 16:28:23,913 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:28:23,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716135694] [2022-02-20 16:28:23,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716135694] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:28:23,913 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:28:23,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-20 16:28:23,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057698838] [2022-02-20 16:28:23,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:28:23,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:28:23,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:28:23,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:28,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 9 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 16:28:28,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:28:28,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:28:28,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:28:28,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=17, Unknown=2, NotChecked=8, Total=42 [2022-02-20 16:28:28,543 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:30,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:28:32,752 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-02-20 16:28:34,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:28:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:36,158 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-20 16:28:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:28:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:28:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:28:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-02-20 16:28:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-02-20 16:28:36,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2022-02-20 16:28:41,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 11 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 16:28:41,076 INFO L225 Difference]: With dead ends: 13 [2022-02-20 16:28:41,076 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 16:28:41,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=17, Invalid=18, Unknown=3, NotChecked=18, Total=56 [2022-02-20 16:28:41,078 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:28:41,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 6 Unchecked, 4.7s Time] [2022-02-20 16:28:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 16:28:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 16:28:41,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:28:41,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:41,083 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:41,083 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:41,084 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 16:28:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 16:28:41,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:28:41,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:28:41,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 9 states. [2022-02-20 16:28:41,085 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 9 states. [2022-02-20 16:28:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:28:41,086 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 16:28:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 16:28:41,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:28:41,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:28:41,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:28:41,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:28:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 16:28:41,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-02-20 16:28:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:28:41,088 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 16:28:41,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:28:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 16:28:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:28:41,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:28:41,089 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-20 16:28:41,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:28:41,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:28:41,314 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:28:41,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:28:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 2 times [2022-02-20 16:28:41,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:28:41,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465956015] [2022-02-20 16:28:41,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:28:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:28:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:28:41,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:28:41,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:28:42,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:28:42,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:28:42,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:28:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:28:42,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:28:50,091 WARN L860 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-02-20 16:28:50,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {184#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:28:50,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~res~0#1, main_~i~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {188#(and (= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:50,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#(and (= |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (= currentRoundingMode roundNearestTiesToEven))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1))));main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {192#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:50,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {192#(and (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) |ULTIMATE.start_main_~x~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1))));main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {196#(and (= |ULTIMATE.start_main_~x~0#1| (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32))))))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:28:50,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {196#(and (= |ULTIMATE.start_main_~x~0#1| (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32))))))))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {180#false} is VALID [2022-02-20 16:28:50,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 67050bv64 == main_~res~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {180#false} is VALID [2022-02-20 16:28:50,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {180#false} is VALID [2022-02-20 16:28:50,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-02-20 16:28:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 16:28:50,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:28:56,407 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-02-20 16:28:58,476 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-02-20 16:29:04,900 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-02-20 16:29:07,036 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-02-20 16:29:13,313 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-02-20 16:29:15,401 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-02-20 16:29:15,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-02-20 16:29:15,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {180#false} is VALID [2022-02-20 16:29:15,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 67050bv64 == main_~res~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {180#false} is VALID [2022-02-20 16:29:15,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {218#(not (fp.eq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} assume !!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32)); {180#false} is VALID [2022-02-20 16:29:15,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {222#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1))));main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {218#(not (fp.eq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is VALID [2022-02-20 16:29:15,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} assume !!!~fp.eq~LONGDOUBLE(main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 0bv32));main_~res~0#1 := ~bvadd64(main_~res~0#1, ~sign_extendFrom32To64(~bvmul32(~bvsrem32(~convertLONGDOUBLEToINT(~roundTowardZero, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32))), 10bv32), ~bvmul32(10bv32, main_~i~0#1))));main_~x~0#1 := ~fp.sub~LONGDOUBLE(currentRoundingMode, ~fp.mul~LONGDOUBLE(currentRoundingMode, main_~x~0#1, ~convertINTToLONGDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToLONGDOUBLE(currentRoundingMode, ~bvmul32(10bv32, ~convertLONGDOUBLEToINT(~roundTowardZero, main_~x~0#1))));main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := ~bvadd32(1bv32, main_#t~post4#1);havoc main_#t~post4#1; {222#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is VALID [2022-02-20 16:29:15,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))))))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_~x~0#1, main_~res~0#1, main_~i~0#1;main_~x~0#1 := ~convertDOUBLEToLONGDOUBLE(currentRoundingMode, ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 7.0)));main_~res~0#1 := 0bv64;main_~i~0#1 := 1bv32; {226#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is VALID [2022-02-20 16:29:15,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {230#(not (fp.eq (fp.sub currentRoundingMode (fp.mul currentRoundingMode (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))) ((_ to_fp 15 113) currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0)))) (_ bv10 32)))))))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))} is VALID [2022-02-20 16:29:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-20 16:29:15,409 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:29:15,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465956015] [2022-02-20 16:29:15,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465956015] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:29:15,410 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:29:15,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-02-20 16:29:15,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926467656] [2022-02-20 16:29:15,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:29:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:29:15,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:29:15,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)