./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float-no-simp2.i --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-cbmc-regression/float-no-simp2.i -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 3a05fe72602a07075e0f1ee0a98d5ddb537d1e938bc846ad5ae314bafebdfe0d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:19:51,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:19:51,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:19:51,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:19:51,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:19:51,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:19:51,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:19:51,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:19:51,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:19:51,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:19:51,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:19:51,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:19:51,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:19:51,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:19:51,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:19:51,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:19:51,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:19:51,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:19:51,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:19:51,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:19:51,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:19:51,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:19:51,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:19:51,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:19:51,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:19:51,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:19:51,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:19:51,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:19:51,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:19:51,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:19:51,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:19:51,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:19:51,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:19:51,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:19:51,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:19:51,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:19:51,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:19:51,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:19:51,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:19:51,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:19:51,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:19:51,590 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:19:51,615 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:19:51,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:19:51,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:19:51,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:19:51,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:19:51,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:19:51,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:19:51,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:19:51,619 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:19:51,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:19:51,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:19:51,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:19:51,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:19:51,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:19:51,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:19:51,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:19:51,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:19:51,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:19:51,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:19:51,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:19:51,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:19:51,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:19:51,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:19:51,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:19:51,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:19:51,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:19:51,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:19:51,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:19:51,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:19:51,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:19:51,623 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:19:51,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:19:51,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:19:51,624 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 -> 3a05fe72602a07075e0f1ee0a98d5ddb537d1e938bc846ad5ae314bafebdfe0d [2022-02-20 16:19:51,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:19:51,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:19:51,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:19:51,818 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:19:51,818 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:19:51,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-no-simp2.i [2022-02-20 16:19:51,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4236fd6a/4a80683094cf42f4b63aed163027badc/FLAGb608f71ba [2022-02-20 16:19:52,309 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:19:52,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp2.i [2022-02-20 16:19:52,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4236fd6a/4a80683094cf42f4b63aed163027badc/FLAGb608f71ba [2022-02-20 16:19:52,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4236fd6a/4a80683094cf42f4b63aed163027badc [2022-02-20 16:19:52,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:19:52,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:19:52,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:19:52,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:19:52,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:19:52,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:19:52" (1/1) ... [2022-02-20 16:19:52,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc145e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:52, skipping insertion in model container [2022-02-20 16:19:52,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:19:52" (1/1) ... [2022-02-20 16:19:52,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:19:52,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:19:52,731 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:848) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:1792) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:235) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1442) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2407) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2407) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1449) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1076) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1465) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2356) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:19:52,736 INFO L158 Benchmark]: Toolchain (without parser) took 391.64ms. Allocated memory is still 111.1MB. Free memory was 81.6MB in the beginning and 80.8MB in the end (delta: 820.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:19:52,736 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:19:52,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.21ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 80.8MB in the end (delta: 656.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:19:52,738 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.21ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 80.8MB in the end (delta: 656.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:848) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-cbmc-regression/float-no-simp2.i -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 3a05fe72602a07075e0f1ee0a98d5ddb537d1e938bc846ad5ae314bafebdfe0d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:19:54,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:19:54,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:19:54,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:19:54,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:19:54,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:19:54,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:19:54,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:19:54,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:19:54,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:19:54,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:19:54,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:19:54,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:19:54,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:19:54,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:19:54,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:19:54,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:19:54,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:19:54,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:19:54,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:19:54,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:19:54,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:19:54,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:19:54,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:19:54,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:19:54,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:19:54,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:19:54,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:19:54,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:19:54,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:19:54,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:19:54,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:19:54,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:19:54,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:19:54,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:19:54,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:19:54,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:19:54,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:19:54,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:19:54,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:19:54,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:19:54,226 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:19:54,249 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:19:54,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:19:54,250 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:19:54,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:19:54,251 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:19:54,251 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:19:54,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:19:54,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:19:54,253 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:19:54,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:19:54,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:19:54,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:19:54,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:19:54,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:19:54,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:19:54,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:19:54,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:19:54,254 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:19:54,254 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:19:54,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:19:54,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:19:54,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:19:54,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:19:54,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:19:54,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:19:54,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:19:54,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:19:54,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:19:54,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:19:54,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:19:54,256 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:19:54,256 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:19:54,256 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:19:54,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:19:54,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:19:54,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:19:54,257 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 -> 3a05fe72602a07075e0f1ee0a98d5ddb537d1e938bc846ad5ae314bafebdfe0d [2022-02-20 16:19:54,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:19:54,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:19:54,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:19:54,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:19:54,542 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:19:54,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-no-simp2.i [2022-02-20 16:19:54,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/809bbdf79/04123e4a299a4af78f6e70eb9dc0dc96/FLAGf8dcefc35 [2022-02-20 16:19:54,985 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:19:54,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp2.i [2022-02-20 16:19:54,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/809bbdf79/04123e4a299a4af78f6e70eb9dc0dc96/FLAGf8dcefc35 [2022-02-20 16:19:55,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/809bbdf79/04123e4a299a4af78f6e70eb9dc0dc96 [2022-02-20 16:19:55,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:19:55,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:19:55,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:19:55,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:19:55,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:19:55,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:55,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb9bf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55, skipping insertion in model container [2022-02-20 16:19:55,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:55,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:19:55,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:19:55,728 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-cbmc-regression/float-no-simp2.i[41138,41151] [2022-02-20 16:19:55,731 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-cbmc-regression/float-no-simp2.i[41179,41192] [2022-02-20 16:19:55,732 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-cbmc-regression/float-no-simp2.i[41229,41242] [2022-02-20 16:19:55,733 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-cbmc-regression/float-no-simp2.i[41279,41292] [2022-02-20 16:19:55,734 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-cbmc-regression/float-no-simp2.i[41329,41342] [2022-02-20 16:19:55,734 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-cbmc-regression/float-no-simp2.i[41381,41394] [2022-02-20 16:19:55,735 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-cbmc-regression/float-no-simp2.i[41427,41440] [2022-02-20 16:19:55,736 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-cbmc-regression/float-no-simp2.i[41470,41483] [2022-02-20 16:19:55,736 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-cbmc-regression/float-no-simp2.i[41521,41534] [2022-02-20 16:19:55,737 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-cbmc-regression/float-no-simp2.i[41562,41575] [2022-02-20 16:19:55,738 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-cbmc-regression/float-no-simp2.i[41603,41616] [2022-02-20 16:19:55,739 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-cbmc-regression/float-no-simp2.i[41649,41662] [2022-02-20 16:19:55,740 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-cbmc-regression/float-no-simp2.i[41690,41703] [2022-02-20 16:19:55,740 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-cbmc-regression/float-no-simp2.i[41743,41756] [2022-02-20 16:19:55,740 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-cbmc-regression/float-no-simp2.i[41794,41807] [2022-02-20 16:19:55,741 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-cbmc-regression/float-no-simp2.i[41842,41855] [2022-02-20 16:19:55,742 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-cbmc-regression/float-no-simp2.i[41891,41904] [2022-02-20 16:19:55,743 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-cbmc-regression/float-no-simp2.i[41934,41947] [2022-02-20 16:19:55,745 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-cbmc-regression/float-no-simp2.i[41977,41990] [2022-02-20 16:19:55,745 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-cbmc-regression/float-no-simp2.i[42041,42054] [2022-02-20 16:19:55,746 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-cbmc-regression/float-no-simp2.i[42104,42117] [2022-02-20 16:19:55,746 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-cbmc-regression/float-no-simp2.i[42144,42157] [2022-02-20 16:19:55,747 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-cbmc-regression/float-no-simp2.i[42183,42196] [2022-02-20 16:19:55,747 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-cbmc-regression/float-no-simp2.i[42229,42242] [2022-02-20 16:19:55,747 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-cbmc-regression/float-no-simp2.i[42276,42289] [2022-02-20 16:19:55,748 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-cbmc-regression/float-no-simp2.i[42324,42337] [2022-02-20 16:19:55,749 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-cbmc-regression/float-no-simp2.i[42375,42388] [2022-02-20 16:19:55,750 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-cbmc-regression/float-no-simp2.i[42419,42432] [2022-02-20 16:19:55,750 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-cbmc-regression/float-no-simp2.i[42462,42475] [2022-02-20 16:19:55,752 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-cbmc-regression/float-no-simp2.i[42507,42520] [2022-02-20 16:19:55,752 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-cbmc-regression/float-no-simp2.i[42549,42562] [2022-02-20 16:19:55,753 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-cbmc-regression/float-no-simp2.i[42592,42605] [2022-02-20 16:19:55,754 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-cbmc-regression/float-no-simp2.i[42637,42650] [2022-02-20 16:19:55,754 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-cbmc-regression/float-no-simp2.i[42683,42696] [2022-02-20 16:19:55,754 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-cbmc-regression/float-no-simp2.i[42728,42741] [2022-02-20 16:19:55,755 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-cbmc-regression/float-no-simp2.i[42771,42784] [2022-02-20 16:19:55,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:19:55,768 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:19:55,800 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-cbmc-regression/float-no-simp2.i[41138,41151] [2022-02-20 16:19:55,801 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-cbmc-regression/float-no-simp2.i[41179,41192] [2022-02-20 16:19:55,801 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-cbmc-regression/float-no-simp2.i[41229,41242] [2022-02-20 16:19:55,804 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-cbmc-regression/float-no-simp2.i[41279,41292] [2022-02-20 16:19:55,804 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-cbmc-regression/float-no-simp2.i[41329,41342] [2022-02-20 16:19:55,805 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-cbmc-regression/float-no-simp2.i[41381,41394] [2022-02-20 16:19:55,805 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-cbmc-regression/float-no-simp2.i[41427,41440] [2022-02-20 16:19:55,805 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-cbmc-regression/float-no-simp2.i[41470,41483] [2022-02-20 16:19:55,806 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-cbmc-regression/float-no-simp2.i[41521,41534] [2022-02-20 16:19:55,807 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-cbmc-regression/float-no-simp2.i[41562,41575] [2022-02-20 16:19:55,807 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-cbmc-regression/float-no-simp2.i[41603,41616] [2022-02-20 16:19:55,808 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-cbmc-regression/float-no-simp2.i[41649,41662] [2022-02-20 16:19:55,809 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-cbmc-regression/float-no-simp2.i[41690,41703] [2022-02-20 16:19:55,810 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-cbmc-regression/float-no-simp2.i[41743,41756] [2022-02-20 16:19:55,810 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-cbmc-regression/float-no-simp2.i[41794,41807] [2022-02-20 16:19:55,811 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-cbmc-regression/float-no-simp2.i[41842,41855] [2022-02-20 16:19:55,811 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-cbmc-regression/float-no-simp2.i[41891,41904] [2022-02-20 16:19:55,812 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-cbmc-regression/float-no-simp2.i[41934,41947] [2022-02-20 16:19:55,812 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-cbmc-regression/float-no-simp2.i[41977,41990] [2022-02-20 16:19:55,813 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-cbmc-regression/float-no-simp2.i[42041,42054] [2022-02-20 16:19:55,814 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-cbmc-regression/float-no-simp2.i[42104,42117] [2022-02-20 16:19:55,815 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-cbmc-regression/float-no-simp2.i[42144,42157] [2022-02-20 16:19:55,816 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-cbmc-regression/float-no-simp2.i[42183,42196] [2022-02-20 16:19:55,816 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-cbmc-regression/float-no-simp2.i[42229,42242] [2022-02-20 16:19:55,816 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-cbmc-regression/float-no-simp2.i[42276,42289] [2022-02-20 16:19:55,817 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-cbmc-regression/float-no-simp2.i[42324,42337] [2022-02-20 16:19:55,818 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-cbmc-regression/float-no-simp2.i[42375,42388] [2022-02-20 16:19:55,818 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-cbmc-regression/float-no-simp2.i[42419,42432] [2022-02-20 16:19:55,819 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-cbmc-regression/float-no-simp2.i[42462,42475] [2022-02-20 16:19:55,821 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-cbmc-regression/float-no-simp2.i[42507,42520] [2022-02-20 16:19:55,821 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-cbmc-regression/float-no-simp2.i[42549,42562] [2022-02-20 16:19:55,822 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-cbmc-regression/float-no-simp2.i[42592,42605] [2022-02-20 16:19:55,822 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-cbmc-regression/float-no-simp2.i[42637,42650] [2022-02-20 16:19:55,823 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-cbmc-regression/float-no-simp2.i[42683,42696] [2022-02-20 16:19:55,823 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-cbmc-regression/float-no-simp2.i[42728,42741] [2022-02-20 16:19:55,824 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-cbmc-regression/float-no-simp2.i[42771,42784] [2022-02-20 16:19:55,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:19:55,925 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:19:55,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55 WrapperNode [2022-02-20 16:19:55,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:19:55,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:19:55,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:19:55,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:19:55,931 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:19:55" (1/1) ... [2022-02-20 16:19:55,959 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:19:55" (1/1) ... [2022-02-20 16:19:56,000 INFO L137 Inliner]: procedures = 449, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2022-02-20 16:19:56,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:19:56,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:19:56,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:19:56,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:19:56,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:56,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:56,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:56,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:56,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:56,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:56,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:56,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:19:56,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:19:56,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:19:56,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:19:56,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (1/1) ... [2022-02-20 16:19:56,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:19:56,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:19:56,070 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:19:56,076 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:19:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:19:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:19:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:19:56,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:19:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 16:19:56,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 16:19:56,153 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:19:56,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:19:58,910 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:19:58,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:19:58,915 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:19:58,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:19:58 BoogieIcfgContainer [2022-02-20 16:19:58,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:19:58,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:19:58,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:19:58,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:19:58,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:19:55" (1/3) ... [2022-02-20 16:19:58,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37929f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:19:58, skipping insertion in model container [2022-02-20 16:19:58,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:19:55" (2/3) ... [2022-02-20 16:19:58,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37929f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:19:58, skipping insertion in model container [2022-02-20 16:19:58,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:19:58" (3/3) ... [2022-02-20 16:19:58,922 INFO L111 eAbstractionObserver]: Analyzing ICFG float-no-simp2.i [2022-02-20 16:19:58,925 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:19:58,925 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-02-20 16:19:58,958 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:19:58,962 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:19:58,963 INFO L340 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-02-20 16:19:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 80 states have (on average 1.9125) internal successors, (153), 116 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:19:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:19:58,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:19:58,980 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:19:58,981 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:19:58,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:19:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash -626203073, now seen corresponding path program 1 times [2022-02-20 16:19:58,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:19:58,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476160327] [2022-02-20 16:19:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:19:58,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:19:58,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:19:58,995 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:19:58,996 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:19:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:19:59,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:19:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:19:59,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:19:59,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#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(17bv32, 2bv32); {123#true} is VALID [2022-02-20 16:19:59,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_~f~0#1, main_~f2~0#1;havoc main_~f~0#1;havoc main_~f2~0#1;main_~f2~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1; {123#true} is VALID [2022-02-20 16:19:59,129 INFO L272 TraceCheckUtils]: 2: Hoare triple {123#true} call assume_abort_if_not((if 0bv32 == (if ~fp.isNaN~DOUBLE(main_~f2~0#1) then 1bv32 else 0bv32) then 1bv32 else 0bv32)); {123#true} is VALID [2022-02-20 16:19:59,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {123#true} ~cond := #in~cond; {123#true} is VALID [2022-02-20 16:19:59,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {123#true} assume 0bv32 == ~cond;assume false; {123#true} is VALID [2022-02-20 16:19:59,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} assume true; {123#true} is VALID [2022-02-20 16:19:59,130 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {123#true} {123#true} #305#return; {123#true} is VALID [2022-02-20 16:19:59,130 INFO L272 TraceCheckUtils]: 7: Hoare triple {123#true} call assume_abort_if_not((if (~fp.isNormal~DOUBLE(main_~f2~0#1) || ~fp.isSubnormal~DOUBLE(main_~f2~0#1)) || ~fp.isZero~DOUBLE(main_~f2~0#1) then 1bv32 else 0bv32)); {123#true} is VALID [2022-02-20 16:19:59,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {123#true} ~cond := #in~cond; {123#true} is VALID [2022-02-20 16:19:59,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {123#true} assume 0bv32 == ~cond;assume false; {123#true} is VALID [2022-02-20 16:19:59,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {123#true} assume true; {123#true} is VALID [2022-02-20 16:19:59,131 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {123#true} {123#true} #307#return; {123#true} is VALID [2022-02-20 16:19:59,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {123#true} main_~f~0#1 := main_~f2~0#1; {123#true} is VALID [2022-02-20 16:19:59,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {123#true} assume !~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~convertINTToDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToDOUBLE(currentRoundingMode, 110bv32)); {124#false} is VALID [2022-02-20 16:19:59,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 16:19:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:19:59,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:19:59,137 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:19:59,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476160327] [2022-02-20 16:19:59,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476160327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:19:59,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:19:59,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:19:59,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955571499] [2022-02-20 16:19:59,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:19:59,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2022-02-20 16:19:59,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:19:59,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:19:59,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:19:59,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:19:59,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:19:59,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:19:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:19:59,186 INFO L87 Difference]: Start difference. First operand has 120 states, 80 states have (on average 1.9125) internal successors, (153), 116 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:02,058 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2022-02-20 16:20:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:20:02,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2022-02-20 16:20:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2022-02-20 16:20:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2022-02-20 16:20:02,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 252 transitions. [2022-02-20 16:20:02,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:02,690 INFO L225 Difference]: With dead ends: 177 [2022-02-20 16:20:02,690 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:20:02,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:20:02,694 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:02,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:20:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:20:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 16:20:02,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:02,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:02,715 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:02,715 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:02,718 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 16:20:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 16:20:02,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:02,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:02,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-02-20 16:20:02,719 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 40 states. [2022-02-20 16:20:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:02,721 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 16:20:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 16:20:02,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:02,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:02,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:02,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-02-20 16:20:02,724 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 15 [2022-02-20 16:20:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:02,725 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-02-20 16:20:02,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-02-20 16:20:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:20:02,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:02,726 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:02,735 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:20:02,933 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:20:02,934 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash -199249201, now seen corresponding path program 1 times [2022-02-20 16:20:02,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:02,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469224435] [2022-02-20 16:20:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:02,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:02,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:02,936 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:20:02,938 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:20:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:03,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:20:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:03,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:03,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#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(17bv32, 2bv32); {479#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:03,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_~f~0#1, main_~f2~0#1;havoc main_~f~0#1;havoc main_~f2~0#1;main_~f2~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1; {479#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:03,798 INFO L272 TraceCheckUtils]: 2: Hoare triple {479#(= currentRoundingMode roundNearestTiesToEven)} call assume_abort_if_not((if 0bv32 == (if ~fp.isNaN~DOUBLE(main_~f2~0#1) then 1bv32 else 0bv32) then 1bv32 else 0bv32)); {479#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:03,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {479#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {479#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:03,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {479#(= currentRoundingMode roundNearestTiesToEven)} assume !(0bv32 == ~cond); {479#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:03,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {479#(= currentRoundingMode roundNearestTiesToEven)} assume true; {479#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:03,800 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {479#(= currentRoundingMode roundNearestTiesToEven)} {479#(= currentRoundingMode roundNearestTiesToEven)} #305#return; {479#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:03,801 INFO L272 TraceCheckUtils]: 7: Hoare triple {479#(= currentRoundingMode roundNearestTiesToEven)} call assume_abort_if_not((if (~fp.isNormal~DOUBLE(main_~f2~0#1) || ~fp.isSubnormal~DOUBLE(main_~f2~0#1)) || ~fp.isZero~DOUBLE(main_~f2~0#1) then 1bv32 else 0bv32)); {479#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:03,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {479#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {504#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:03,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(and (= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == ~cond); {508#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:03,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume true; {508#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:03,805 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {508#(and (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} {479#(= currentRoundingMode roundNearestTiesToEven)} #307#return; {515#(and (or (fp.isSubnormal |ULTIMATE.start_main_~f2~0#1|) (fp.isZero |ULTIMATE.start_main_~f2~0#1|) (fp.isNormal |ULTIMATE.start_main_~f2~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:03,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {515#(and (or (fp.isSubnormal |ULTIMATE.start_main_~f2~0#1|) (fp.isZero |ULTIMATE.start_main_~f2~0#1|) (fp.isNormal |ULTIMATE.start_main_~f2~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} main_~f~0#1 := main_~f2~0#1; {519#(and (or (fp.isNormal |ULTIMATE.start_main_~f~0#1|) (fp.isZero |ULTIMATE.start_main_~f~0#1|) (fp.isSubnormal |ULTIMATE.start_main_~f~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:03,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#(and (or (fp.isNormal |ULTIMATE.start_main_~f~0#1|) (fp.isZero |ULTIMATE.start_main_~f~0#1|) (fp.isSubnormal |ULTIMATE.start_main_~f~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~convertINTToDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToDOUBLE(currentRoundingMode, 110bv32)); {519#(and (or (fp.isNormal |ULTIMATE.start_main_~f~0#1|) (fp.isZero |ULTIMATE.start_main_~f~0#1|) (fp.isSubnormal |ULTIMATE.start_main_~f~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:03,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {519#(and (or (fp.isNormal |ULTIMATE.start_main_~f~0#1|) (fp.isZero |ULTIMATE.start_main_~f~0#1|) (fp.isSubnormal |ULTIMATE.start_main_~f~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 0bv32), main_~f~0#1), main_~f~0#1); {475#false} is VALID [2022-02-20 16:20:03,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-02-20 16:20:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:20:03,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:03,810 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:03,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469224435] [2022-02-20 16:20:03,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469224435] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:03,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:03,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:20:03,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429863333] [2022-02-20 16:20:03,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:03,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-02-20 16:20:03,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:03,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:03,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:03,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:20:03,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:03,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:20:03,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:20:03,832 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:06,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:20:08,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:20:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:08,789 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-02-20 16:20:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:20:08,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2022-02-20 16:20:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-20 16:20:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-02-20 16:20:08,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-02-20 16:20:08,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:08,975 INFO L225 Difference]: With dead ends: 40 [2022-02-20 16:20:08,975 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:20:08,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:20:08,976 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:08,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 22 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-02-20 16:20:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:20:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 16:20:08,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:08,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:08,979 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:08,979 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:08,980 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 16:20:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 16:20:08,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:08,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:08,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-02-20 16:20:08,981 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-02-20 16:20:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:08,982 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 16:20:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 16:20:08,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:08,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:08,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:08,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:08,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-02-20 16:20:08,984 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 16 [2022-02-20 16:20:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:08,984 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-02-20 16:20:08,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 16:20:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 16:20:08,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:08,985 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:08,999 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:20:09,195 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:20:09,196 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:09,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1441315119, now seen corresponding path program 1 times [2022-02-20 16:20:09,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:09,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701893135] [2022-02-20 16:20:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:09,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:09,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:09,200 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:20:09,202 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:20:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:09,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:20:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 16:20:11,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:20,431 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~f~0#1| (_ FloatingPoint 11 53))) (and (not (fp.eq (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~f~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) |ULTIMATE.start_main_~f~0#1|)) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~f~0#1|) .cse0)))) is different from false [2022-02-20 16:20:22,439 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~f~0#1| (_ FloatingPoint 11 53))) (and (not (fp.eq (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~f~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) |ULTIMATE.start_main_~f~0#1|)) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~f~0#1|) .cse0)))) is different from true [2022-02-20 16:20:22,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#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(17bv32, 2bv32); {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_~f~0#1, main_~f2~0#1;havoc main_~f~0#1;havoc main_~f2~0#1;main_~f2~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1; {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,441 INFO L272 TraceCheckUtils]: 2: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} call assume_abort_if_not((if 0bv32 == (if ~fp.isNaN~DOUBLE(main_~f2~0#1) then 1bv32 else 0bv32) then 1bv32 else 0bv32)); {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} assume !(0bv32 == ~cond); {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} assume true; {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,442 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {679#(= currentRoundingMode roundNearestTiesToEven)} {679#(= currentRoundingMode roundNearestTiesToEven)} #305#return; {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,443 INFO L272 TraceCheckUtils]: 7: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} call assume_abort_if_not((if (~fp.isNormal~DOUBLE(main_~f2~0#1) || ~fp.isSubnormal~DOUBLE(main_~f2~0#1)) || ~fp.isZero~DOUBLE(main_~f2~0#1) then 1bv32 else 0bv32)); {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} assume !(0bv32 == ~cond); {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} assume true; {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,444 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {679#(= currentRoundingMode roundNearestTiesToEven)} {679#(= currentRoundingMode roundNearestTiesToEven)} #307#return; {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} main_~f~0#1 := main_~f2~0#1; {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} assume !!~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~convertINTToDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToDOUBLE(currentRoundingMode, 110bv32)); {679#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:22,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {679#(= currentRoundingMode roundNearestTiesToEven)} assume !!~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 0bv32), main_~f~0#1), main_~f~0#1); {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:22,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 100bv32), ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~to_fp~DOUBLE(currentRoundingMode, 100.5)); {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:22,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.sub~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~convertINTToDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToDOUBLE(currentRoundingMode, 90bv32)); {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:22,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.sub~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 100bv32), ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~to_fp~DOUBLE(currentRoundingMode, 99.5)); {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:22,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.neg~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 100.0))), ~convertINTToDOUBLE(currentRoundingMode, 100bv32)); {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:22,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.neg~DOUBLE(~fp.sub~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 1bv32), ~to_fp~DOUBLE(currentRoundingMode, 2.0))), ~convertINTToDOUBLE(currentRoundingMode, 1bv32)); {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:22,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.neg~DOUBLE(~fp.neg~DOUBLE(main_~f~0#1)), main_~f~0#1); {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:22,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~convertINTToDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToDOUBLE(currentRoundingMode, 1000bv32)); {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:22,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {722#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 0bv32), main_~f~0#1), ~convertINTToDOUBLE(currentRoundingMode, 0bv32)); {747#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:22,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {747#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, main_~f~0#1, ~convertINTToDOUBLE(currentRoundingMode, 0bv32)), ~convertINTToDOUBLE(currentRoundingMode, 0bv32)); {747#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:22,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {747#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 100bv32), ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~convertINTToDOUBLE(currentRoundingMode, 50bv32)); {747#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:22,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {747#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, main_~f~0#1, ~convertINTToDOUBLE(currentRoundingMode, 1bv32)), main_~f~0#1); {757#(exists ((|ULTIMATE.start_main_~f~0#1| (_ FloatingPoint 11 53))) (and (not (fp.eq (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~f~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) |ULTIMATE.start_main_~f~0#1|)) (fp.eq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))} is VALID [2022-02-20 16:20:24,500 WARN L290 TraceCheckUtils]: 26: Hoare triple {757#(exists ((|ULTIMATE.start_main_~f~0#1| (_ FloatingPoint 11 53))) (and (not (fp.eq (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~f~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) |ULTIMATE.start_main_~f~0#1|)) (fp.eq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))} assume !false; {675#false} is UNKNOWN [2022-02-20 16:20:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:20:24,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:24,500 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:24,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701893135] [2022-02-20 16:20:24,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701893135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:24,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:24,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:20:24,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756677854] [2022-02-20 16:20:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:24,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 16:20:24,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:24,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:26,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:26,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:20:26,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:26,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:20:26,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=10, Unknown=2, NotChecked=6, Total=30 [2022-02-20 16:20:26,756 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:29,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:20:31,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:20:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:31,720 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 16:20:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:20:31,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-02-20 16:20:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 16:20:31,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 16:20:31,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-02-20 16:20:34,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:34,125 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:20:34,125 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:20:34,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=12, Invalid=10, Unknown=2, NotChecked=6, Total=30 [2022-02-20 16:20:34,126 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:34,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 29 Unchecked, 4.7s Time] [2022-02-20 16:20:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:20:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:20:34,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:34,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:34,129 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:34,129 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:34,131 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 16:20:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 16:20:34,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:34,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:34,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:20:34,132 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:20:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:34,133 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 16:20:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 16:20:34,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:34,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:34,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:34,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:20:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-02-20 16:20:34,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2022-02-20 16:20:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:34,135 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-02-20 16:20:34,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 16:20:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 16:20:34,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:34,136 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:34,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:34,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:34,347 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 528942919, now seen corresponding path program 1 times [2022-02-20 16:20:34,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:34,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045423689] [2022-02-20 16:20:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:34,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:34,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:34,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:34,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:20:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:35,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:20:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 16:20:37,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:48,635 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~f~0#1| (_ FloatingPoint 11 53))) (and (not (fp.eq (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~f~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~f~0#1|)) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~f~0#1|) .cse0)))) is different from false [2022-02-20 16:20:50,651 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~f~0#1| (_ FloatingPoint 11 53))) (and (not (fp.eq (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~f~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~f~0#1|)) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.eq (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~f~0#1|) .cse0)))) is different from true [2022-02-20 16:20:50,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {888#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(17bv32, 2bv32); {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_~f~0#1, main_~f2~0#1;havoc main_~f~0#1;havoc main_~f2~0#1;main_~f2~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1; {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,652 INFO L272 TraceCheckUtils]: 2: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} call assume_abort_if_not((if 0bv32 == (if ~fp.isNaN~DOUBLE(main_~f2~0#1) then 1bv32 else 0bv32) then 1bv32 else 0bv32)); {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} assume !(0bv32 == ~cond); {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} assume true; {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,654 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {893#(= currentRoundingMode roundNearestTiesToEven)} {893#(= currentRoundingMode roundNearestTiesToEven)} #305#return; {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,654 INFO L272 TraceCheckUtils]: 7: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} call assume_abort_if_not((if (~fp.isNormal~DOUBLE(main_~f2~0#1) || ~fp.isSubnormal~DOUBLE(main_~f2~0#1)) || ~fp.isZero~DOUBLE(main_~f2~0#1) then 1bv32 else 0bv32)); {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} ~cond := #in~cond; {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} assume !(0bv32 == ~cond); {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} assume true; {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,656 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {893#(= currentRoundingMode roundNearestTiesToEven)} {893#(= currentRoundingMode roundNearestTiesToEven)} #307#return; {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} main_~f~0#1 := main_~f2~0#1; {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} assume !!~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~convertINTToDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToDOUBLE(currentRoundingMode, 110bv32)); {893#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:20:50,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {893#(= currentRoundingMode roundNearestTiesToEven)} assume !!~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 0bv32), main_~f~0#1), main_~f~0#1); {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:50,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 100bv32), ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~to_fp~DOUBLE(currentRoundingMode, 100.5)); {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:50,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.sub~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~convertINTToDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToDOUBLE(currentRoundingMode, 90bv32)); {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:50,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.sub~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 100bv32), ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~to_fp~DOUBLE(currentRoundingMode, 99.5)); {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:50,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.neg~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 100.0))), ~convertINTToDOUBLE(currentRoundingMode, 100bv32)); {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:50,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.neg~DOUBLE(~fp.sub~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 1bv32), ~to_fp~DOUBLE(currentRoundingMode, 2.0))), ~convertINTToDOUBLE(currentRoundingMode, 1bv32)); {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:50,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.neg~DOUBLE(~fp.neg~DOUBLE(main_~f~0#1)), main_~f~0#1); {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:50,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~convertINTToDOUBLE(currentRoundingMode, 10bv32)), ~convertINTToDOUBLE(currentRoundingMode, 1000bv32)); {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} is VALID [2022-02-20 16:20:50,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {936#(and (= currentRoundingMode roundNearestTiesToEven) (fp.eq (fp.add currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) |ULTIMATE.start_main_~f~0#1|))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 0bv32), main_~f~0#1), ~convertINTToDOUBLE(currentRoundingMode, 0bv32)); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, main_~f~0#1, ~convertINTToDOUBLE(currentRoundingMode, 0bv32)), ~convertINTToDOUBLE(currentRoundingMode, 0bv32)); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 100bv32), ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~convertINTToDOUBLE(currentRoundingMode, 50bv32)); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.mul~DOUBLE(currentRoundingMode, main_~f~0#1, ~convertINTToDOUBLE(currentRoundingMode, 1bv32)), main_~f~0#1); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~convertINTToDOUBLE(currentRoundingMode, 100bv32)); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.1), ~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~to_fp~DOUBLE(currentRoundingMode, 100.1)); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~convertINTToDOUBLE(currentRoundingMode, 50bv32)); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 100.0), ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~convertINTToDOUBLE(currentRoundingMode, 200bv32)); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.eq~DOUBLE(~fp.div~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 0bv32), ~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~convertINTToDOUBLE(currentRoundingMode, 0bv32)); {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:20:50,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {961#(and (fp.eq (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.eq~DOUBLE(~fp.div~DOUBLE(currentRoundingMode, main_~f~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0)), main_~f~0#1); {989#(exists ((|ULTIMATE.start_main_~f~0#1| (_ FloatingPoint 11 53))) (and (not (fp.eq (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~f~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~f~0#1|)) (fp.eq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))} is VALID [2022-02-20 16:20:52,746 WARN L290 TraceCheckUtils]: 32: Hoare triple {989#(exists ((|ULTIMATE.start_main_~f~0#1| (_ FloatingPoint 11 53))) (and (not (fp.eq (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~f~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) |ULTIMATE.start_main_~f~0#1|)) (fp.eq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) |ULTIMATE.start_main_~f~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))} assume !false; {889#false} is UNKNOWN [2022-02-20 16:20:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:20:52,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:52,747 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:52,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045423689] [2022-02-20 16:20:52,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045423689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:52,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:52,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:20:52,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297821318] [2022-02-20 16:20:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:52,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-02-20 16:20:52,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:52,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:55,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:55,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:20:55,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:55,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:20:55,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=10, Unknown=2, NotChecked=6, Total=30 [2022-02-20 16:20:55,494 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:58,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:20:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:58,011 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 16:20:58,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:20:58,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-02-20 16:20:58,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-20 16:20:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-20 16:20:58,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-02-20 16:21:01,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:01,241 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:21:01,241 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:21:01,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=12, Invalid=10, Unknown=2, NotChecked=6, Total=30 [2022-02-20 16:21:01,242 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:01,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 1 Unknown, 28 Unchecked, 2.3s Time] [2022-02-20 16:21:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:21:01,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:21:01,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:01,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:01,244 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:01,244 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:01,244 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:21:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:21:01,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:01,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:01,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:21:01,245 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:21:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:01,245 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:21:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:21:01,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:01,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:01,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:01,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:21:01,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-02-20 16:21:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:01,248 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:21:01,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:21:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:21:01,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:01,250 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (35 of 36 remaining) [2022-02-20 16:21:01,250 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (34 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (33 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (32 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (31 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (30 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (29 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (28 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (27 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (26 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (25 of 36 remaining) [2022-02-20 16:21:01,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (24 of 36 remaining) [2022-02-20 16:21:01,252 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (23 of 36 remaining) [2022-02-20 16:21:01,252 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (22 of 36 remaining) [2022-02-20 16:21:01,252 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (21 of 36 remaining) [2022-02-20 16:21:01,252 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (20 of 36 remaining) [2022-02-20 16:21:01,252 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (19 of 36 remaining) [2022-02-20 16:21:01,256 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (18 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (17 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (16 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (15 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (14 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (13 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (12 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (11 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (10 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (9 of 36 remaining) [2022-02-20 16:21:01,257 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (8 of 36 remaining) [2022-02-20 16:21:01,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (7 of 36 remaining) [2022-02-20 16:21:01,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (6 of 36 remaining) [2022-02-20 16:21:01,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (5 of 36 remaining) [2022-02-20 16:21:01,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (4 of 36 remaining) [2022-02-20 16:21:01,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (3 of 36 remaining) [2022-02-20 16:21:01,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (2 of 36 remaining) [2022-02-20 16:21:01,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (1 of 36 remaining) [2022-02-20 16:21:01,258 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (0 of 36 remaining) [2022-02-20 16:21:01,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:21:01,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:21:01,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:21:01,481 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1023) no Hoare annotation was computed. [2022-02-20 16:21:01,481 INFO L858 garLoopResultBuilder]: For program point L1026-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,481 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 977) no Hoare annotation was computed. [2022-02-20 16:21:01,481 INFO L858 garLoopResultBuilder]: For program point L977(line 977) no Hoare annotation was computed. [2022-02-20 16:21:01,481 INFO L858 garLoopResultBuilder]: For program point L977-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,481 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 999) no Hoare annotation was computed. [2022-02-20 16:21:01,481 INFO L858 garLoopResultBuilder]: For program point L1027(line 1027) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L1027-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1016) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L1028(line 1028) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L995(line 995) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L1028-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L995-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 998) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L1012(line 1012) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L979(line 979) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L1012-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,482 INFO L858 garLoopResultBuilder]: For program point L979-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1015) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point L1029(line 1029) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point L996(line 996) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point L1029-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point L996-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 991) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point L1013(line 1013) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point L1013-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,483 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1008) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 1028) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L1030(line 1030) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L997(line 997) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L997-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L1014(line 1014) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L1014-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L998(line 998) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L998-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 995) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L1015(line 1015) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point L1015-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,484 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L999(line 999) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 1030) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L966(lines 966 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L999-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 992) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L1016(line 1016) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L983(line 983) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L1016-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L983-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1009) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 1029) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 1024) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L1017(line 1017) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 979) no Hoare annotation was computed. [2022-02-20 16:21:01,485 INFO L858 garLoopResultBuilder]: For program point L1017-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1004) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 996) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point L1018(line 1018) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point L1018-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 986) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point L1019(line 1019) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point L986(line 986) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point L1019-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point L986-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1006) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 1026) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 1025) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 983) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point L1004(line 1004) no Hoare annotation was computed. [2022-02-20 16:21:01,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1005) no Hoare annotation was computed. [2022-02-20 16:21:01,487 INFO L854 garLoopResultBuilder]: At program point L971(line 971) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2022-02-20 16:21:01,487 INFO L854 garLoopResultBuilder]: At program point L971-1(line 971) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2022-02-20 16:21:01,487 INFO L858 garLoopResultBuilder]: For program point L1004-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,487 INFO L858 garLoopResultBuilder]: For program point L1005(line 1005) no Hoare annotation was computed. [2022-02-20 16:21:01,487 INFO L858 garLoopResultBuilder]: For program point L972(line 972) no Hoare annotation was computed. [2022-02-20 16:21:01,487 INFO L858 garLoopResultBuilder]: For program point L1005-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,487 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1018) no Hoare annotation was computed. [2022-02-20 16:21:01,487 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 990) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point L1022(line 1022) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point L1022-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1007) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point L1006(line 1006) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point L1006-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 1027) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point L1023(line 1023) no Hoare annotation was computed. [2022-02-20 16:21:01,488 INFO L858 garLoopResultBuilder]: For program point L990(line 990) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point L1023-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point L990-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 976) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point L1007(line 1007) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point L1007-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1022) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point L991(line 991) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point L1024-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,489 INFO L858 garLoopResultBuilder]: For program point L991-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L1008(line 1008) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L1008-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1019) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L1025(line 1025) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L992(line 992) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L1025-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L992-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 997) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L1009(line 1009) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L976(line 976) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L976-1(line 976) no Hoare annotation was computed. [2022-02-20 16:21:01,490 INFO L858 garLoopResultBuilder]: For program point L1009-2(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,491 INFO L858 garLoopResultBuilder]: For program point L976-3(lines 967 1031) no Hoare annotation was computed. [2022-02-20 16:21:01,491 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1014) no Hoare annotation was computed. [2022-02-20 16:21:01,491 INFO L858 garLoopResultBuilder]: For program point L1026(line 1026) no Hoare annotation was computed. [2022-02-20 16:21:01,491 INFO L858 garLoopResultBuilder]: For program point L3-2(lines 2 4) no Hoare annotation was computed. [2022-02-20 16:21:01,491 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 2 4) the Hoare annotation is: true [2022-02-20 16:21:01,491 INFO L858 garLoopResultBuilder]: For program point L3(line 3) no Hoare annotation was computed. [2022-02-20 16:21:01,491 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 2 4) no Hoare annotation was computed. [2022-02-20 16:21:01,493 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:21:01,494 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:21:01,496 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:21:01,496 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2022-02-20 16:21:01,496 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L972 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L972 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L976 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L976 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L976-1 has no Hoare annotation [2022-02-20 16:21:01,497 WARN L170 areAnnotationChecker]: L976-1 has no Hoare annotation [2022-02-20 16:21:01,506 WARN L170 areAnnotationChecker]: L976-3 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L976-3 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L977 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L977 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L977-2 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L977-2 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L979 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L979 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L979-2 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L979-2 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L983 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L983 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L983-2 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L983-2 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2022-02-20 16:21:01,507 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L986-2 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L986-2 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L990 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L990 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L990-2 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L990-2 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L991 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L991 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L991-2 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L991-2 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L992 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L992 has no Hoare annotation [2022-02-20 16:21:01,508 WARN L170 areAnnotationChecker]: L992-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L992-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L995-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L996 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L996 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L996-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L996-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L997 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L997 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L997-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L997-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L998-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L998-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L999 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L999 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L999-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L999-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L1004-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L1004-2 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2022-02-20 16:21:01,509 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1005-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1006-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1006-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1007-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1007-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1009 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1009-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1009-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1012-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1012-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1013 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1013 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1013-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1013-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1014 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2022-02-20 16:21:01,510 WARN L170 areAnnotationChecker]: L1014-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1015-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1015-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1016 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1016 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1016-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1016-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1017 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1017 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1017-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1017-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1018 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1018 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1018-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1018-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1022 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1022 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1022-2 has no Hoare annotation [2022-02-20 16:21:01,511 WARN L170 areAnnotationChecker]: L1022-2 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1023 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1023-2 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1023-2 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2022-02-20 16:21:01,512 WARN L170 areAnnotationChecker]: L1025-2 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1025-2 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1026 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1026 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1027 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1027-2 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1028 has no Hoare annotation [2022-02-20 16:21:01,513 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: L1028-2 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: L1029 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: L1029-2 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: L1030 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: L966 has no Hoare annotation [2022-02-20 16:21:01,514 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:21:01,514 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:21:01,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:21:01 BoogieIcfgContainer [2022-02-20 16:21:01,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:21:01,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:21:01,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:21:01,516 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:21:01,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:19:58" (3/4) ... [2022-02-20 16:21:01,519 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:21:01,522 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 16:21:01,526 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 16:21:01,526 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:21:01,526 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:21:01,527 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:21:01,553 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:21:01,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:21:01,554 INFO L158 Benchmark]: Toolchain (without parser) took 66220.68ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 41.9MB in the beginning and 46.4MB in the end (delta: -4.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 16:21:01,554 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory was 44.9MB in the beginning and 44.8MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:01,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.97ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 41.6MB in the beginning and 57.5MB in the end (delta: -15.9MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-02-20 16:21:01,555 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.44ms. Allocated memory is still 77.6MB. Free memory was 57.5MB in the beginning and 54.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:01,555 INFO L158 Benchmark]: Boogie Preprocessor took 45.81ms. Allocated memory is still 77.6MB. Free memory was 54.3MB in the beginning and 52.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:01,555 INFO L158 Benchmark]: RCFGBuilder took 2869.21ms. Allocated memory is still 77.6MB. Free memory was 52.0MB in the beginning and 37.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:21:01,556 INFO L158 Benchmark]: TraceAbstraction took 62597.71ms. Allocated memory is still 77.6MB. Free memory was 37.0MB in the beginning and 50.7MB in the end (delta: -13.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:01,556 INFO L158 Benchmark]: Witness Printer took 37.52ms. Allocated memory is still 77.6MB. Free memory was 50.7MB in the beginning and 46.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:21:01,557 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.14ms. Allocated memory is still 62.9MB. Free memory was 44.9MB in the beginning and 44.8MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.97ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 41.6MB in the beginning and 57.5MB in the end (delta: -15.9MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.44ms. Allocated memory is still 77.6MB. Free memory was 57.5MB in the beginning and 54.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.81ms. Allocated memory is still 77.6MB. Free memory was 54.3MB in the beginning and 52.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2869.21ms. Allocated memory is still 77.6MB. Free memory was 52.0MB in the beginning and 37.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 62597.71ms. Allocated memory is still 77.6MB. Free memory was 37.0MB in the beginning and 50.7MB in the end (delta: -13.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Witness Printer took 37.52ms. Allocated memory is still 77.6MB. Free memory was 50.7MB in the beginning and 46.4MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 976]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 977]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 979]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 983]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 986]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 990]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 991]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 992]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 995]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 996]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 997]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 998]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 999]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1004]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1005]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1006]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1007]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1008]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1009]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1012]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1014]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1015]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1016]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1017]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1018]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1019]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1022]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1023]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1024]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1025]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1026]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1027]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1028]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1029]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1030]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 62.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 57 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 89 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 6 NumberOfFragments, 7 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 32.5s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 87 ConstructedInterpolants, 2 QuantifiedInterpolants, 581 SizeOfPredicates, 8 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 16:21:01,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE