./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-simp4.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc7a65c92d510e4307dcba36e5a22f1084eef775 ...................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-simp4.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc7a65c92d510e4307dcba36e5a22f1084eef775 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:20:31,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:20:31,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:20:31,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:20:31,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:20:31,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:20:31,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:20:31,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:20:31,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:20:31,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:20:31,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:20:31,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:20:31,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:20:31,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:20:31,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:20:31,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:20:31,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:20:31,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:20:31,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:20:31,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:20:31,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:20:31,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:20:31,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:20:31,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:20:31,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:20:31,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:20:31,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:20:31,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:20:31,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:20:31,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:20:31,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:20:31,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:20:31,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:20:31,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:20:31,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:20:31,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:20:31,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:20:31,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:20:31,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:20:31,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:20:31,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:20:31,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:20:31,635 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:20:31,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:20:31,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:20:31,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:20:31,640 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:20:31,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:20:31,640 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:20:31,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:20:31,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:20:31,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:20:31,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:20:31,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:20:31,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:20:31,644 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:20:31,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:20:31,645 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:20:31,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:20:31,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:20:31,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:20:31,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:20:31,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:20:31,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:20:31,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:20:31,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:20:31,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:20:31,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:20:31,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:20:31,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:20:31,649 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:20:31,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> bc7a65c92d510e4307dcba36e5a22f1084eef775 [2020-07-28 17:20:31,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:20:31,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:20:31,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:20:31,978 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:20:31,981 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:20:31,982 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i [2020-07-28 17:20:32,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac301e32c/f5ef9b51d6e24e00812a5c81ea353fda/FLAG3176e9cfc [2020-07-28 17:20:32,597 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:20:32,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i [2020-07-28 17:20:32,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac301e32c/f5ef9b51d6e24e00812a5c81ea353fda/FLAG3176e9cfc [2020-07-28 17:20:32,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac301e32c/f5ef9b51d6e24e00812a5c81ea353fda [2020-07-28 17:20:32,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:20:32,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:20:32,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:20:32,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:20:32,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:20:32,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:20:32" (1/1) ... [2020-07-28 17:20:32,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16482b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:32, skipping insertion in model container [2020-07-28 17:20:32,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:20:32" (1/1) ... [2020-07-28 17:20:32,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:20:32,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:20:33,573 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: fpclassify at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:846) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:1652) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:211) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1385) 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:1064) 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:2326) 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:697) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2326) 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:174) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:676) 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:1392) 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:1336) 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:1029) 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:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1407) 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:3469) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:571) 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:125) 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:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 17:20:33,638 INFO L168 Benchmark]: Toolchain (without parser) took 752.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:20:33,639 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:20:33,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.46 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:20:33,642 INFO L336 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 692.46 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:846) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:20:35,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:20:35,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:20:35,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:20:35,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:20:35,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:20:35,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:20:35,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:20:35,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:20:35,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:20:35,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:20:35,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:20:35,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:20:35,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:20:35,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:20:35,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:20:35,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:20:35,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:20:35,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:20:35,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:20:35,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:20:35,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:20:35,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:20:35,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:20:35,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:20:35,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:20:35,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:20:35,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:20:35,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:20:35,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:20:35,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:20:35,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:20:35,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:20:35,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:20:35,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:20:35,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:20:35,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:20:35,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:20:35,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:20:35,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:20:35,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:20:35,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 17:20:35,514 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:20:35,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:20:35,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:20:35,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:20:35,522 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:20:35,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:20:35,523 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:20:35,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:20:35,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:20:35,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:20:35,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:20:35,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:20:35,525 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:20:35,525 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:20:35,527 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:20:35,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:20:35,528 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:20:35,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:20:35,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:20:35,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:20:35,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:20:35,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:20:35,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:20:35,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:20:35,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:20:35,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:20:35,531 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:20:35,531 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:20:35,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:20:35,533 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:20:35,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:20:35,533 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> bc7a65c92d510e4307dcba36e5a22f1084eef775 [2020-07-28 17:20:35,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:20:35,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:20:35,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:20:35,864 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:20:35,865 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:20:35,865 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i [2020-07-28 17:20:35,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1270ed501/de36c27d15384e09a060d9678db9ad0e/FLAG36c42d9df [2020-07-28 17:20:36,521 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:20:36,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i [2020-07-28 17:20:36,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1270ed501/de36c27d15384e09a060d9678db9ad0e/FLAG36c42d9df [2020-07-28 17:20:36,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1270ed501/de36c27d15384e09a060d9678db9ad0e [2020-07-28 17:20:36,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:20:36,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:20:36,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:20:36,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:20:36,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:20:36,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:20:36" (1/1) ... [2020-07-28 17:20:36,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df76798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:36, skipping insertion in model container [2020-07-28 17:20:36,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:20:36" (1/1) ... [2020-07-28 17:20:36,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:20:36,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:20:37,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:20:37,575 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:20:37,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:20:37,975 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:20:37,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37 WrapperNode [2020-07-28 17:20:37,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:20:37,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:20:37,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:20:37,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:20:37,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:20:38,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:20:38,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:20:38,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:20:38,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... [2020-07-28 17:20:38,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:20:38,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:20:38,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:20:38,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:20:38,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:20:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:20:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:20:38,575 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:20:38,576 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:20:38,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:20:38 BoogieIcfgContainer [2020-07-28 17:20:38,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:20:38,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:20:38,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:20:38,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:20:38,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:20:36" (1/3) ... [2020-07-28 17:20:38,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2347dc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:20:38, skipping insertion in model container [2020-07-28 17:20:38,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:20:37" (2/3) ... [2020-07-28 17:20:38,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2347dc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:20:38, skipping insertion in model container [2020-07-28 17:20:38,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:20:38" (3/3) ... [2020-07-28 17:20:38,590 INFO L109 eAbstractionObserver]: Analyzing ICFG float-no-simp4.i [2020-07-28 17:20:38,601 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:20:38,609 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-07-28 17:20:38,623 INFO L251 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-07-28 17:20:38,648 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:20:38,649 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:20:38,649 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:20:38,649 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:20:38,650 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:20:38,650 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:20:38,650 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:20:38,650 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:20:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-07-28 17:20:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 17:20:38,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:20:38,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 17:20:38,678 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:20:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:20:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash 28693891, now seen corresponding path program 1 times [2020-07-28 17:20:38,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:20:38,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962908245] [2020-07-28 17:20:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 17:20:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:38,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:20:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:38,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:20:38,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#true} currentRoundingMode := ~roundNearestTiesToEven; {50#true} is VALID [2020-07-28 17:20:38,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {50#true} is VALID [2020-07-28 17:20:38,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {51#false} is VALID [2020-07-28 17:20:38,801 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#false} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {51#false} is VALID [2020-07-28 17:20:38,801 INFO L280 TraceCheckUtils]: 4: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-28 17:20:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:38,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:20:38,813 INFO L280 TraceCheckUtils]: 4: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-28 17:20:38,813 INFO L280 TraceCheckUtils]: 3: Hoare triple {51#false} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {51#false} is VALID [2020-07-28 17:20:38,814 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {51#false} is VALID [2020-07-28 17:20:38,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {50#true} is VALID [2020-07-28 17:20:38,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#true} currentRoundingMode := ~roundNearestTiesToEven; {50#true} is VALID [2020-07-28 17:20:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:38,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962908245] [2020-07-28 17:20:38,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:20:38,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:20:38,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633153504] [2020-07-28 17:20:38,823 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 17:20:38,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:20:38,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:20:38,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:38,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:20:38,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:20:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:20:38,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:20:38,867 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2020-07-28 17:20:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:38,973 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2020-07-28 17:20:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:20:38,974 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 17:20:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:20:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:20:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 120 transitions. [2020-07-28 17:20:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:20:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 120 transitions. [2020-07-28 17:20:38,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 120 transitions. [2020-07-28 17:20:39,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:39,203 INFO L225 Difference]: With dead ends: 91 [2020-07-28 17:20:39,203 INFO L226 Difference]: Without dead ends: 44 [2020-07-28 17:20:39,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:20:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-28 17:20:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-28 17:20:39,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:20:39,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-28 17:20:39,235 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-28 17:20:39,235 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-28 17:20:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:39,240 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-28 17:20:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2020-07-28 17:20:39,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:39,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:39,242 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-28 17:20:39,242 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-28 17:20:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:39,246 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-28 17:20:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2020-07-28 17:20:39,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:39,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:39,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:20:39,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:20:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-28 17:20:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2020-07-28 17:20:39,253 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 5 [2020-07-28 17:20:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:20:39,254 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2020-07-28 17:20:39,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:20:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2020-07-28 17:20:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 17:20:39,255 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:20:39,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 17:20:39,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:20:39,470 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:20:39,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:20:39,471 INFO L82 PathProgramCache]: Analyzing trace with hash 28695813, now seen corresponding path program 1 times [2020-07-28 17:20:39,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:20:39,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484969779] [2020-07-28 17:20:39,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 17:20:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:39,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 17:20:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:39,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:20:40,244 WARN L193 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 11 [2020-07-28 17:20:40,271 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:20:40,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {301#true} currentRoundingMode := ~roundNearestTiesToEven; {301#true} is VALID [2020-07-28 17:20:40,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {301#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {309#(or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isNormal ULTIMATE.start_main_~d1~0)) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNormal ULTIMATE.start_main_~d1~0))))} is VALID [2020-07-28 17:20:40,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#(or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isNormal ULTIMATE.start_main_~d1~0)) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNormal ULTIMATE.start_main_~d1~0))))} assume !(0bv32 == assume_abort_if_not_~cond); {313#(fp.isNormal ULTIMATE.start_main_~d1~0)} is VALID [2020-07-28 17:20:40,300 INFO L280 TraceCheckUtils]: 3: Hoare triple {313#(fp.isNormal ULTIMATE.start_main_~d1~0)} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {302#false} is VALID [2020-07-28 17:20:40,301 INFO L280 TraceCheckUtils]: 4: Hoare triple {302#false} assume !false; {302#false} is VALID [2020-07-28 17:20:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:40,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:20:40,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {302#false} assume !false; {302#false} is VALID [2020-07-28 17:20:40,368 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#(not (fp.isNaN ULTIMATE.start_main_~d1~0))} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {302#false} is VALID [2020-07-28 17:20:40,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {327#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNaN ULTIMATE.start_main_~d1~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {323#(not (fp.isNaN ULTIMATE.start_main_~d1~0))} is VALID [2020-07-28 17:20:40,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {301#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {327#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNaN ULTIMATE.start_main_~d1~0)))} is VALID [2020-07-28 17:20:40,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {301#true} currentRoundingMode := ~roundNearestTiesToEven; {301#true} is VALID [2020-07-28 17:20:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:40,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484969779] [2020-07-28 17:20:40,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:20:40,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:20:40,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245717835] [2020-07-28 17:20:40,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2020-07-28 17:20:40,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:20:40,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:20:40,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:40,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:20:40,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:20:40,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:20:40,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:20:40,392 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 6 states. [2020-07-28 17:20:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:40,702 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2020-07-28 17:20:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:20:40,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2020-07-28 17:20:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:20:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:20:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-28 17:20:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:20:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-28 17:20:40,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-28 17:20:40,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:40,798 INFO L225 Difference]: With dead ends: 44 [2020-07-28 17:20:40,801 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 17:20:40,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:20:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 17:20:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-28 17:20:40,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:20:40,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-28 17:20:40,811 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-28 17:20:40,812 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-28 17:20:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:40,816 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2020-07-28 17:20:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2020-07-28 17:20:40,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:40,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:40,819 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-28 17:20:40,819 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-28 17:20:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:40,826 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2020-07-28 17:20:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2020-07-28 17:20:40,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:40,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:40,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:20:40,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:20:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-28 17:20:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2020-07-28 17:20:40,834 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 5 [2020-07-28 17:20:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:20:40,835 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2020-07-28 17:20:40,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:20:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2020-07-28 17:20:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:20:40,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:20:40,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:20:41,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:20:41,048 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:20:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:20:41,049 INFO L82 PathProgramCache]: Analyzing trace with hash -686348615, now seen corresponding path program 1 times [2020-07-28 17:20:41,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:20:41,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043658963] [2020-07-28 17:20:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 17:20:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:41,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 17:20:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:41,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:20:41,140 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:20:41,164 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#true} currentRoundingMode := ~roundNearestTiesToEven; {493#true} is VALID [2020-07-28 17:20:41,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {493#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {493#true} is VALID [2020-07-28 17:20:41,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {493#true} assume !(0bv32 == assume_abort_if_not_~cond); {493#true} is VALID [2020-07-28 17:20:41,165 INFO L280 TraceCheckUtils]: 3: Hoare triple {493#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {493#true} is VALID [2020-07-28 17:20:41,165 INFO L280 TraceCheckUtils]: 4: Hoare triple {493#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {493#true} is VALID [2020-07-28 17:20:41,165 INFO L280 TraceCheckUtils]: 5: Hoare triple {493#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0) || ~fp.isSubnormal~DOUBLE(main_~d1~0)) || ~fp.isZero~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {493#true} is VALID [2020-07-28 17:20:41,174 INFO L280 TraceCheckUtils]: 6: Hoare triple {493#true} main_~d2~0 := main_#t~nondet86;havoc main_#t~nondet86;main_~_d2~0 := main_#t~nondet87;havoc main_#t~nondet87;main_~d2~0 := main_~_d2~0;assume_abort_if_not_#in~cond := (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {516#(or (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isInfinite ULTIMATE.start_main_~d2~0))) (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isInfinite ULTIMATE.start_main_~d2~0)))} is VALID [2020-07-28 17:20:41,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(or (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isInfinite ULTIMATE.start_main_~d2~0))) (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isInfinite ULTIMATE.start_main_~d2~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {520#(fp.isInfinite ULTIMATE.start_main_~d2~0)} is VALID [2020-07-28 17:20:41,176 INFO L280 TraceCheckUtils]: 8: Hoare triple {520#(fp.isInfinite ULTIMATE.start_main_~d2~0)} assume !!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0) then 3bv32 else 2bv32))))); {494#false} is VALID [2020-07-28 17:20:41,176 INFO L280 TraceCheckUtils]: 9: Hoare triple {494#false} assume !false; {494#false} is VALID [2020-07-28 17:20:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:41,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:20:41,313 INFO L280 TraceCheckUtils]: 9: Hoare triple {494#false} assume !false; {494#false} is VALID [2020-07-28 17:20:41,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {530#(not (fp.isNormal ULTIMATE.start_main_~d2~0))} assume !!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0) then 3bv32 else 2bv32))))); {494#false} is VALID [2020-07-28 17:20:41,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {534#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNormal ULTIMATE.start_main_~d2~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {530#(not (fp.isNormal ULTIMATE.start_main_~d2~0))} is VALID [2020-07-28 17:20:41,317 INFO L280 TraceCheckUtils]: 6: Hoare triple {493#true} main_~d2~0 := main_#t~nondet86;havoc main_#t~nondet86;main_~_d2~0 := main_#t~nondet87;havoc main_#t~nondet87;main_~d2~0 := main_~_d2~0;assume_abort_if_not_#in~cond := (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {534#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNormal ULTIMATE.start_main_~d2~0)))} is VALID [2020-07-28 17:20:41,317 INFO L280 TraceCheckUtils]: 5: Hoare triple {493#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0) || ~fp.isSubnormal~DOUBLE(main_~d1~0)) || ~fp.isZero~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {493#true} is VALID [2020-07-28 17:20:41,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {493#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {493#true} is VALID [2020-07-28 17:20:41,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {493#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {493#true} is VALID [2020-07-28 17:20:41,318 INFO L280 TraceCheckUtils]: 2: Hoare triple {493#true} assume !(0bv32 == assume_abort_if_not_~cond); {493#true} is VALID [2020-07-28 17:20:41,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {493#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {493#true} is VALID [2020-07-28 17:20:41,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {493#true} currentRoundingMode := ~roundNearestTiesToEven; {493#true} is VALID [2020-07-28 17:20:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:41,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043658963] [2020-07-28 17:20:41,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:20:41,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:20:41,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750311224] [2020-07-28 17:20:41,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-28 17:20:41,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:20:41,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:20:41,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:41,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:20:41,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:20:41,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:20:41,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:20:41,339 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand 6 states. [2020-07-28 17:20:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:41,545 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2020-07-28 17:20:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:20:41,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-28 17:20:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:20:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:20:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-28 17:20:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:20:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-28 17:20:41,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-28 17:20:41,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:41,599 INFO L225 Difference]: With dead ends: 38 [2020-07-28 17:20:41,600 INFO L226 Difference]: Without dead ends: 34 [2020-07-28 17:20:41,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:20:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-28 17:20:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-28 17:20:41,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:20:41,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2020-07-28 17:20:41,604 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-28 17:20:41,604 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-28 17:20:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:41,606 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2020-07-28 17:20:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2020-07-28 17:20:41,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:41,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:41,607 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2020-07-28 17:20:41,607 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2020-07-28 17:20:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:41,609 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2020-07-28 17:20:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2020-07-28 17:20:41,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:41,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:41,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:20:41,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:20:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-28 17:20:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2020-07-28 17:20:41,611 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 10 [2020-07-28 17:20:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:20:41,612 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2020-07-28 17:20:41,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:20:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2020-07-28 17:20:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:20:41,612 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:20:41,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:20:41,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:20:41,815 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:20:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:20:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1664358106, now seen corresponding path program 1 times [2020-07-28 17:20:41,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:20:41,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767598303] [2020-07-28 17:20:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 17:20:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:41,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 17:20:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:41,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:20:41,918 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:20:41,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {697#true} currentRoundingMode := ~roundNearestTiesToEven; {697#true} is VALID [2020-07-28 17:20:41,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {697#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {697#true} is VALID [2020-07-28 17:20:41,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {697#true} assume !(0bv32 == assume_abort_if_not_~cond); {697#true} is VALID [2020-07-28 17:20:41,945 INFO L280 TraceCheckUtils]: 3: Hoare triple {697#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {697#true} is VALID [2020-07-28 17:20:41,946 INFO L280 TraceCheckUtils]: 4: Hoare triple {697#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {697#true} is VALID [2020-07-28 17:20:41,946 INFO L280 TraceCheckUtils]: 5: Hoare triple {697#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0) || ~fp.isSubnormal~DOUBLE(main_~d1~0)) || ~fp.isZero~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {697#true} is VALID [2020-07-28 17:20:41,947 INFO L280 TraceCheckUtils]: 6: Hoare triple {697#true} main_~d2~0 := main_#t~nondet86;havoc main_#t~nondet86;main_~_d2~0 := main_#t~nondet87;havoc main_#t~nondet87;main_~d2~0 := main_~_d2~0;assume_abort_if_not_#in~cond := (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {697#true} is VALID [2020-07-28 17:20:41,947 INFO L280 TraceCheckUtils]: 7: Hoare triple {697#true} assume !(0bv32 == assume_abort_if_not_~cond); {697#true} is VALID [2020-07-28 17:20:41,947 INFO L280 TraceCheckUtils]: 8: Hoare triple {697#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0) then 3bv32 else 2bv32))))); {697#true} is VALID [2020-07-28 17:20:41,948 INFO L280 TraceCheckUtils]: 9: Hoare triple {697#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0) then 1bv32 else 0bv32)); {697#true} is VALID [2020-07-28 17:20:41,951 INFO L280 TraceCheckUtils]: 10: Hoare triple {697#true} main_~d3~0 := main_#t~nondet88;havoc main_#t~nondet88;main_~_d3~0 := main_#t~nondet89;havoc main_#t~nondet89;main_~d3~0 := main_~_d3~0;assume_abort_if_not_#in~cond := (if ~fp.isNaN~DOUBLE(main_~d3~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {732#(or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isNaN ULTIMATE.start_main_~d3~0)) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNaN ULTIMATE.start_main_~d3~0))))} is VALID [2020-07-28 17:20:41,952 INFO L280 TraceCheckUtils]: 11: Hoare triple {732#(or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isNaN ULTIMATE.start_main_~d3~0)) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNaN ULTIMATE.start_main_~d3~0))))} assume !(0bv32 == assume_abort_if_not_~cond); {736#(fp.isNaN ULTIMATE.start_main_~d3~0)} is VALID [2020-07-28 17:20:41,958 INFO L280 TraceCheckUtils]: 12: Hoare triple {736#(fp.isNaN ULTIMATE.start_main_~d3~0)} assume !!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0) then 3bv32 else 2bv32))))); {698#false} is VALID [2020-07-28 17:20:41,958 INFO L280 TraceCheckUtils]: 13: Hoare triple {698#false} assume !false; {698#false} is VALID [2020-07-28 17:20:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:41,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:20:42,079 INFO L280 TraceCheckUtils]: 13: Hoare triple {698#false} assume !false; {698#false} is VALID [2020-07-28 17:20:42,081 INFO L280 TraceCheckUtils]: 12: Hoare triple {746#(not (fp.isNormal ULTIMATE.start_main_~d3~0))} assume !!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0) then 3bv32 else 2bv32))))); {698#false} is VALID [2020-07-28 17:20:42,082 INFO L280 TraceCheckUtils]: 11: Hoare triple {750#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNormal ULTIMATE.start_main_~d3~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {746#(not (fp.isNormal ULTIMATE.start_main_~d3~0))} is VALID [2020-07-28 17:20:42,083 INFO L280 TraceCheckUtils]: 10: Hoare triple {697#true} main_~d3~0 := main_#t~nondet88;havoc main_#t~nondet88;main_~_d3~0 := main_#t~nondet89;havoc main_#t~nondet89;main_~d3~0 := main_~_d3~0;assume_abort_if_not_#in~cond := (if ~fp.isNaN~DOUBLE(main_~d3~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {750#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNormal ULTIMATE.start_main_~d3~0)))} is VALID [2020-07-28 17:20:42,083 INFO L280 TraceCheckUtils]: 9: Hoare triple {697#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0) then 1bv32 else 0bv32)); {697#true} is VALID [2020-07-28 17:20:42,084 INFO L280 TraceCheckUtils]: 8: Hoare triple {697#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0) then 3bv32 else 2bv32))))); {697#true} is VALID [2020-07-28 17:20:42,084 INFO L280 TraceCheckUtils]: 7: Hoare triple {697#true} assume !(0bv32 == assume_abort_if_not_~cond); {697#true} is VALID [2020-07-28 17:20:42,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {697#true} main_~d2~0 := main_#t~nondet86;havoc main_#t~nondet86;main_~_d2~0 := main_#t~nondet87;havoc main_#t~nondet87;main_~d2~0 := main_~_d2~0;assume_abort_if_not_#in~cond := (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {697#true} is VALID [2020-07-28 17:20:42,084 INFO L280 TraceCheckUtils]: 5: Hoare triple {697#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0) || ~fp.isSubnormal~DOUBLE(main_~d1~0)) || ~fp.isZero~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {697#true} is VALID [2020-07-28 17:20:42,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {697#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {697#true} is VALID [2020-07-28 17:20:42,085 INFO L280 TraceCheckUtils]: 3: Hoare triple {697#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {697#true} is VALID [2020-07-28 17:20:42,085 INFO L280 TraceCheckUtils]: 2: Hoare triple {697#true} assume !(0bv32 == assume_abort_if_not_~cond); {697#true} is VALID [2020-07-28 17:20:42,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {697#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {697#true} is VALID [2020-07-28 17:20:42,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {697#true} currentRoundingMode := ~roundNearestTiesToEven; {697#true} is VALID [2020-07-28 17:20:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:42,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767598303] [2020-07-28 17:20:42,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:20:42,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:20:42,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123871257] [2020-07-28 17:20:42,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-28 17:20:42,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:20:42,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:20:42,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:42,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:20:42,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:20:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:20:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:20:42,116 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand 6 states. [2020-07-28 17:20:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:42,408 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2020-07-28 17:20:42,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:20:42,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-28 17:20:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:20:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:20:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-28 17:20:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:20:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-28 17:20:42,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-28 17:20:42,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:42,468 INFO L225 Difference]: With dead ends: 34 [2020-07-28 17:20:42,468 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 17:20:42,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:20:42,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 17:20:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-28 17:20:42,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:20:42,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-28 17:20:42,472 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 17:20:42,472 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 17:20:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:42,475 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2020-07-28 17:20:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2020-07-28 17:20:42,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:42,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:42,476 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 17:20:42,478 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 17:20:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:42,479 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2020-07-28 17:20:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2020-07-28 17:20:42,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:42,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:42,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:20:42,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:20:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:20:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2020-07-28 17:20:42,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 14 [2020-07-28 17:20:42,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:20:42,485 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2020-07-28 17:20:42,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:20:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2020-07-28 17:20:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:20:42,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:20:42,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:20:42,686 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:20:42,687 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:20:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:20:42,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1867176430, now seen corresponding path program 1 times [2020-07-28 17:20:42,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:20:42,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224196782] [2020-07-28 17:20:42,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 17:20:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:42,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 17:20:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:42,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:20:42,799 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:20:42,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {903#true} currentRoundingMode := ~roundNearestTiesToEven; {903#true} is VALID [2020-07-28 17:20:42,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {903#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {903#true} is VALID [2020-07-28 17:20:42,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {903#true} assume !(0bv32 == assume_abort_if_not_~cond); {903#true} is VALID [2020-07-28 17:20:42,821 INFO L280 TraceCheckUtils]: 3: Hoare triple {903#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,821 INFO L280 TraceCheckUtils]: 4: Hoare triple {903#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,821 INFO L280 TraceCheckUtils]: 5: Hoare triple {903#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0) || ~fp.isSubnormal~DOUBLE(main_~d1~0)) || ~fp.isZero~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {903#true} main_~d2~0 := main_#t~nondet86;havoc main_#t~nondet86;main_~_d2~0 := main_#t~nondet87;havoc main_#t~nondet87;main_~d2~0 := main_~_d2~0;assume_abort_if_not_#in~cond := (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {903#true} is VALID [2020-07-28 17:20:42,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {903#true} assume !(0bv32 == assume_abort_if_not_~cond); {903#true} is VALID [2020-07-28 17:20:42,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {903#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0) then 3bv32 else 2bv32))))); {903#true} is VALID [2020-07-28 17:20:42,822 INFO L280 TraceCheckUtils]: 9: Hoare triple {903#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,822 INFO L280 TraceCheckUtils]: 10: Hoare triple {903#true} main_~d3~0 := main_#t~nondet88;havoc main_#t~nondet88;main_~_d3~0 := main_#t~nondet89;havoc main_#t~nondet89;main_~d3~0 := main_~_d3~0;assume_abort_if_not_#in~cond := (if ~fp.isNaN~DOUBLE(main_~d3~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {903#true} is VALID [2020-07-28 17:20:42,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {903#true} assume !(0bv32 == assume_abort_if_not_~cond); {903#true} is VALID [2020-07-28 17:20:42,823 INFO L280 TraceCheckUtils]: 12: Hoare triple {903#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0) then 3bv32 else 2bv32))))); {903#true} is VALID [2020-07-28 17:20:42,823 INFO L280 TraceCheckUtils]: 13: Hoare triple {903#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,823 INFO L280 TraceCheckUtils]: 14: Hoare triple {903#true} assume !!!~fp.eq~DOUBLE(main_~d3~0, main_~d3~0); {903#true} is VALID [2020-07-28 17:20:42,825 INFO L280 TraceCheckUtils]: 15: Hoare triple {903#true} main_~d4~0 := main_#t~nondet90;havoc main_#t~nondet90;main_~_d4~0 := main_#t~nondet91;havoc main_#t~nondet91;main_~d4~0 := main_~_d4~0;assume_abort_if_not_#in~cond := (if (~fp.isNormal~DOUBLE(main_~d4~0) || ~fp.isSubnormal~DOUBLE(main_~d4~0)) || ~fp.isZero~DOUBLE(main_~d4~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {953#(or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (or (fp.isSubnormal ULTIMATE.start_main_~d4~0) (fp.isNormal ULTIMATE.start_main_~d4~0) (fp.isZero ULTIMATE.start_main_~d4~0))) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isZero ULTIMATE.start_main_~d4~0)) (not (fp.isSubnormal ULTIMATE.start_main_~d4~0)) (not (fp.isNormal ULTIMATE.start_main_~d4~0))))} is VALID [2020-07-28 17:20:42,827 INFO L280 TraceCheckUtils]: 16: Hoare triple {953#(or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (or (fp.isSubnormal ULTIMATE.start_main_~d4~0) (fp.isNormal ULTIMATE.start_main_~d4~0) (fp.isZero ULTIMATE.start_main_~d4~0))) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isZero ULTIMATE.start_main_~d4~0)) (not (fp.isSubnormal ULTIMATE.start_main_~d4~0)) (not (fp.isNormal ULTIMATE.start_main_~d4~0))))} assume !(0bv32 == assume_abort_if_not_~cond); {957#(or (fp.isSubnormal ULTIMATE.start_main_~d4~0) (fp.isNormal ULTIMATE.start_main_~d4~0) (fp.isZero ULTIMATE.start_main_~d4~0))} is VALID [2020-07-28 17:20:42,829 INFO L280 TraceCheckUtils]: 17: Hoare triple {957#(or (fp.isSubnormal ULTIMATE.start_main_~d4~0) (fp.isNormal ULTIMATE.start_main_~d4~0) (fp.isZero ULTIMATE.start_main_~d4~0))} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d4~0) then 1bv32 else 0bv32)); {904#false} is VALID [2020-07-28 17:20:42,829 INFO L280 TraceCheckUtils]: 18: Hoare triple {904#false} assume !false; {904#false} is VALID [2020-07-28 17:20:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:42,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:20:42,878 INFO L280 TraceCheckUtils]: 18: Hoare triple {904#false} assume !false; {904#false} is VALID [2020-07-28 17:20:42,879 INFO L280 TraceCheckUtils]: 17: Hoare triple {967#(not (fp.isNaN ULTIMATE.start_main_~d4~0))} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d4~0) then 1bv32 else 0bv32)); {904#false} is VALID [2020-07-28 17:20:42,879 INFO L280 TraceCheckUtils]: 16: Hoare triple {971#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNaN ULTIMATE.start_main_~d4~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {967#(not (fp.isNaN ULTIMATE.start_main_~d4~0))} is VALID [2020-07-28 17:20:42,881 INFO L280 TraceCheckUtils]: 15: Hoare triple {903#true} main_~d4~0 := main_#t~nondet90;havoc main_#t~nondet90;main_~_d4~0 := main_#t~nondet91;havoc main_#t~nondet91;main_~d4~0 := main_~_d4~0;assume_abort_if_not_#in~cond := (if (~fp.isNormal~DOUBLE(main_~d4~0) || ~fp.isSubnormal~DOUBLE(main_~d4~0)) || ~fp.isZero~DOUBLE(main_~d4~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {971#(or (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isNaN ULTIMATE.start_main_~d4~0)))} is VALID [2020-07-28 17:20:42,881 INFO L280 TraceCheckUtils]: 14: Hoare triple {903#true} assume !!!~fp.eq~DOUBLE(main_~d3~0, main_~d3~0); {903#true} is VALID [2020-07-28 17:20:42,881 INFO L280 TraceCheckUtils]: 13: Hoare triple {903#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {903#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0) then 3bv32 else 2bv32))))); {903#true} is VALID [2020-07-28 17:20:42,882 INFO L280 TraceCheckUtils]: 11: Hoare triple {903#true} assume !(0bv32 == assume_abort_if_not_~cond); {903#true} is VALID [2020-07-28 17:20:42,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {903#true} main_~d3~0 := main_#t~nondet88;havoc main_#t~nondet88;main_~_d3~0 := main_#t~nondet89;havoc main_#t~nondet89;main_~d3~0 := main_~_d3~0;assume_abort_if_not_#in~cond := (if ~fp.isNaN~DOUBLE(main_~d3~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {903#true} is VALID [2020-07-28 17:20:42,882 INFO L280 TraceCheckUtils]: 9: Hoare triple {903#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,882 INFO L280 TraceCheckUtils]: 8: Hoare triple {903#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0) then 3bv32 else 2bv32))))); {903#true} is VALID [2020-07-28 17:20:42,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {903#true} assume !(0bv32 == assume_abort_if_not_~cond); {903#true} is VALID [2020-07-28 17:20:42,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {903#true} main_~d2~0 := main_#t~nondet86;havoc main_#t~nondet86;main_~_d2~0 := main_#t~nondet87;havoc main_#t~nondet87;main_~d2~0 := main_~_d2~0;assume_abort_if_not_#in~cond := (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {903#true} is VALID [2020-07-28 17:20:42,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {903#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0) || ~fp.isSubnormal~DOUBLE(main_~d1~0)) || ~fp.isZero~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,883 INFO L280 TraceCheckUtils]: 4: Hoare triple {903#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,884 INFO L280 TraceCheckUtils]: 3: Hoare triple {903#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {903#true} is VALID [2020-07-28 17:20:42,884 INFO L280 TraceCheckUtils]: 2: Hoare triple {903#true} assume !(0bv32 == assume_abort_if_not_~cond); {903#true} is VALID [2020-07-28 17:20:42,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {903#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {903#true} is VALID [2020-07-28 17:20:42,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {903#true} currentRoundingMode := ~roundNearestTiesToEven; {903#true} is VALID [2020-07-28 17:20:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:42,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224196782] [2020-07-28 17:20:42,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:20:42,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:20:42,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020224943] [2020-07-28 17:20:42,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-28 17:20:42,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:20:42,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:20:42,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:42,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:20:42,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:20:42,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:20:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:20:42,915 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 6 states. [2020-07-28 17:20:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:43,144 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2020-07-28 17:20:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:20:43,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-28 17:20:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:20:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:20:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 17:20:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:20:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 17:20:43,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-28 17:20:43,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:43,212 INFO L225 Difference]: With dead ends: 28 [2020-07-28 17:20:43,212 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 17:20:43,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:20:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 17:20:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-28 17:20:43,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:20:43,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-28 17:20:43,217 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-28 17:20:43,217 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-28 17:20:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:43,219 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-07-28 17:20:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2020-07-28 17:20:43,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:43,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:43,220 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-28 17:20:43,220 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-28 17:20:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:43,222 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-07-28 17:20:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2020-07-28 17:20:43,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:43,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:43,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:20:43,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:20:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 17:20:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2020-07-28 17:20:43,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 19 [2020-07-28 17:20:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:20:43,231 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2020-07-28 17:20:43,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:20:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2020-07-28 17:20:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 17:20:43,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:20:43,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:20:43,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 17:20:43,434 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:20:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:20:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1057859749, now seen corresponding path program 1 times [2020-07-28 17:20:43,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:20:43,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120313697] [2020-07-28 17:20:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-28 17:20:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:43,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 17:20:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:20:43,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:20:43,592 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:20:43,594 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:20:43,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {1121#true} currentRoundingMode := ~roundNearestTiesToEven; {1121#true} is VALID [2020-07-28 17:20:43,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {1121#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1121#true} is VALID [2020-07-28 17:20:43,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {1121#true} assume !(0bv32 == assume_abort_if_not_~cond); {1121#true} is VALID [2020-07-28 17:20:43,613 INFO L280 TraceCheckUtils]: 3: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {1121#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0) || ~fp.isSubnormal~DOUBLE(main_~d1~0)) || ~fp.isZero~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,614 INFO L280 TraceCheckUtils]: 6: Hoare triple {1121#true} main_~d2~0 := main_#t~nondet86;havoc main_#t~nondet86;main_~_d2~0 := main_#t~nondet87;havoc main_#t~nondet87;main_~d2~0 := main_~_d2~0;assume_abort_if_not_#in~cond := (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1121#true} is VALID [2020-07-28 17:20:43,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {1121#true} assume !(0bv32 == assume_abort_if_not_~cond); {1121#true} is VALID [2020-07-28 17:20:43,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {1121#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0) then 3bv32 else 2bv32))))); {1121#true} is VALID [2020-07-28 17:20:43,614 INFO L280 TraceCheckUtils]: 9: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,615 INFO L280 TraceCheckUtils]: 10: Hoare triple {1121#true} main_~d3~0 := main_#t~nondet88;havoc main_#t~nondet88;main_~_d3~0 := main_#t~nondet89;havoc main_#t~nondet89;main_~d3~0 := main_~_d3~0;assume_abort_if_not_#in~cond := (if ~fp.isNaN~DOUBLE(main_~d3~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1121#true} is VALID [2020-07-28 17:20:43,615 INFO L280 TraceCheckUtils]: 11: Hoare triple {1121#true} assume !(0bv32 == assume_abort_if_not_~cond); {1121#true} is VALID [2020-07-28 17:20:43,615 INFO L280 TraceCheckUtils]: 12: Hoare triple {1121#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0) then 3bv32 else 2bv32))))); {1121#true} is VALID [2020-07-28 17:20:43,615 INFO L280 TraceCheckUtils]: 13: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,616 INFO L280 TraceCheckUtils]: 14: Hoare triple {1121#true} assume !!!~fp.eq~DOUBLE(main_~d3~0, main_~d3~0); {1121#true} is VALID [2020-07-28 17:20:43,616 INFO L280 TraceCheckUtils]: 15: Hoare triple {1121#true} main_~d4~0 := main_#t~nondet90;havoc main_#t~nondet90;main_~_d4~0 := main_#t~nondet91;havoc main_#t~nondet91;main_~d4~0 := main_~_d4~0;assume_abort_if_not_#in~cond := (if (~fp.isNormal~DOUBLE(main_~d4~0) || ~fp.isSubnormal~DOUBLE(main_~d4~0)) || ~fp.isZero~DOUBLE(main_~d4~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1121#true} is VALID [2020-07-28 17:20:43,616 INFO L280 TraceCheckUtils]: 16: Hoare triple {1121#true} assume !(0bv32 == assume_abort_if_not_~cond); {1121#true} is VALID [2020-07-28 17:20:43,616 INFO L280 TraceCheckUtils]: 17: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d4~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,617 INFO L280 TraceCheckUtils]: 18: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d4~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,622 INFO L280 TraceCheckUtils]: 19: Hoare triple {1121#true} main_~d5~0 := main_#t~nondet92;havoc main_#t~nondet92;main_~_d5~0 := main_#t~nondet93;havoc main_#t~nondet93;main_~d5~0 := main_~_d5~0;assume_abort_if_not_#in~cond := (if 0bv32 == (if ~fp.isNaN~DOUBLE(main_~d5~0) then 1bv32 else 0bv32) && 0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d5~0) then 1bv32 else 0bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1183#(or (and (not (fp.isNaN ULTIMATE.start_main_~d5~0)) (or (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isInfinite ULTIMATE.start_main_~d5~0)) (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isInfinite ULTIMATE.start_main_~d5~0))))) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isNaN ULTIMATE.start_main_~d5~0)))} is VALID [2020-07-28 17:20:43,623 INFO L280 TraceCheckUtils]: 20: Hoare triple {1183#(or (and (not (fp.isNaN ULTIMATE.start_main_~d5~0)) (or (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isInfinite ULTIMATE.start_main_~d5~0)) (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (not (fp.isInfinite ULTIMATE.start_main_~d5~0))))) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.isNaN ULTIMATE.start_main_~d5~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {1187#(and (not (fp.isNaN ULTIMATE.start_main_~d5~0)) (not (fp.isInfinite ULTIMATE.start_main_~d5~0)))} is VALID [2020-07-28 17:20:43,624 INFO L280 TraceCheckUtils]: 21: Hoare triple {1187#(and (not (fp.isNaN ULTIMATE.start_main_~d5~0)) (not (fp.isInfinite ULTIMATE.start_main_~d5~0)))} assume 0bv32 == (if (~fp.isNormal~DOUBLE(main_~d5~0) || ~fp.isSubnormal~DOUBLE(main_~d5~0)) || ~fp.isZero~DOUBLE(main_~d5~0) then 1bv32 else 0bv32); {1122#false} is VALID [2020-07-28 17:20:43,625 INFO L280 TraceCheckUtils]: 22: Hoare triple {1122#false} assume !false; {1122#false} is VALID [2020-07-28 17:20:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:43,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:20:43,687 INFO L280 TraceCheckUtils]: 22: Hoare triple {1122#false} assume !false; {1122#false} is VALID [2020-07-28 17:20:43,688 INFO L280 TraceCheckUtils]: 21: Hoare triple {1187#(and (not (fp.isNaN ULTIMATE.start_main_~d5~0)) (not (fp.isInfinite ULTIMATE.start_main_~d5~0)))} assume 0bv32 == (if (~fp.isNormal~DOUBLE(main_~d5~0) || ~fp.isSubnormal~DOUBLE(main_~d5~0)) || ~fp.isZero~DOUBLE(main_~d5~0) then 1bv32 else 0bv32); {1122#false} is VALID [2020-07-28 17:20:43,689 INFO L280 TraceCheckUtils]: 20: Hoare triple {1200#(or (and (not (fp.isNaN ULTIMATE.start_main_~d5~0)) (not (fp.isInfinite ULTIMATE.start_main_~d5~0))) (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond))} assume !(0bv32 == assume_abort_if_not_~cond); {1187#(and (not (fp.isNaN ULTIMATE.start_main_~d5~0)) (not (fp.isInfinite ULTIMATE.start_main_~d5~0)))} is VALID [2020-07-28 17:20:43,691 INFO L280 TraceCheckUtils]: 19: Hoare triple {1121#true} main_~d5~0 := main_#t~nondet92;havoc main_#t~nondet92;main_~_d5~0 := main_#t~nondet93;havoc main_#t~nondet93;main_~d5~0 := main_~_d5~0;assume_abort_if_not_#in~cond := (if 0bv32 == (if ~fp.isNaN~DOUBLE(main_~d5~0) then 1bv32 else 0bv32) && 0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d5~0) then 1bv32 else 0bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1200#(or (and (not (fp.isNaN ULTIMATE.start_main_~d5~0)) (not (fp.isInfinite ULTIMATE.start_main_~d5~0))) (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond))} is VALID [2020-07-28 17:20:43,691 INFO L280 TraceCheckUtils]: 18: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d4~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,692 INFO L280 TraceCheckUtils]: 17: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d4~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,692 INFO L280 TraceCheckUtils]: 16: Hoare triple {1121#true} assume !(0bv32 == assume_abort_if_not_~cond); {1121#true} is VALID [2020-07-28 17:20:43,692 INFO L280 TraceCheckUtils]: 15: Hoare triple {1121#true} main_~d4~0 := main_#t~nondet90;havoc main_#t~nondet90;main_~_d4~0 := main_#t~nondet91;havoc main_#t~nondet91;main_~d4~0 := main_~_d4~0;assume_abort_if_not_#in~cond := (if (~fp.isNormal~DOUBLE(main_~d4~0) || ~fp.isSubnormal~DOUBLE(main_~d4~0)) || ~fp.isZero~DOUBLE(main_~d4~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1121#true} is VALID [2020-07-28 17:20:43,692 INFO L280 TraceCheckUtils]: 14: Hoare triple {1121#true} assume !!!~fp.eq~DOUBLE(main_~d3~0, main_~d3~0); {1121#true} is VALID [2020-07-28 17:20:43,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,693 INFO L280 TraceCheckUtils]: 12: Hoare triple {1121#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0) then 3bv32 else 2bv32))))); {1121#true} is VALID [2020-07-28 17:20:43,693 INFO L280 TraceCheckUtils]: 11: Hoare triple {1121#true} assume !(0bv32 == assume_abort_if_not_~cond); {1121#true} is VALID [2020-07-28 17:20:43,694 INFO L280 TraceCheckUtils]: 10: Hoare triple {1121#true} main_~d3~0 := main_#t~nondet88;havoc main_#t~nondet88;main_~_d3~0 := main_#t~nondet89;havoc main_#t~nondet89;main_~d3~0 := main_~_d3~0;assume_abort_if_not_#in~cond := (if ~fp.isNaN~DOUBLE(main_~d3~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1121#true} is VALID [2020-07-28 17:20:43,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,694 INFO L280 TraceCheckUtils]: 8: Hoare triple {1121#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0) then 3bv32 else 2bv32))))); {1121#true} is VALID [2020-07-28 17:20:43,694 INFO L280 TraceCheckUtils]: 7: Hoare triple {1121#true} assume !(0bv32 == assume_abort_if_not_~cond); {1121#true} is VALID [2020-07-28 17:20:43,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {1121#true} main_~d2~0 := main_#t~nondet86;havoc main_#t~nondet86;main_~_d2~0 := main_#t~nondet87;havoc main_#t~nondet87;main_~d2~0 := main_~_d2~0;assume_abort_if_not_#in~cond := (if ~fp.isInfinite~DOUBLE(main_~d2~0) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1121#true} is VALID [2020-07-28 17:20:43,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {1121#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0) || ~fp.isSubnormal~DOUBLE(main_~d1~0)) || ~fp.isZero~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,695 INFO L280 TraceCheckUtils]: 3: Hoare triple {1121#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0) then 1bv32 else 0bv32)); {1121#true} is VALID [2020-07-28 17:20:43,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {1121#true} assume !(0bv32 == assume_abort_if_not_~cond); {1121#true} is VALID [2020-07-28 17:20:43,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {1121#true} havoc main_#res;havoc main_#t~nondet84, main_#t~nondet85, main_#t~nondet86, main_#t~nondet87, main_#t~nondet88, main_#t~nondet89, main_#t~nondet90, main_#t~nondet91, main_#t~nondet92, main_#t~nondet93, main_~d1~0, main_~_d1~0, main_~d2~0, main_~_d2~0, main_~d3~0, main_~_d3~0, main_~d4~0, main_~_d4~0, main_~d5~0, main_~_d5~0;main_~d1~0 := main_#t~nondet84;havoc main_#t~nondet84;main_~_d1~0 := main_#t~nondet85;havoc main_#t~nondet85;main_~d1~0 := main_~_d1~0;assume_abort_if_not_#in~cond := (if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1121#true} is VALID [2020-07-28 17:20:43,696 INFO L280 TraceCheckUtils]: 0: Hoare triple {1121#true} currentRoundingMode := ~roundNearestTiesToEven; {1121#true} is VALID [2020-07-28 17:20:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:20:43,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120313697] [2020-07-28 17:20:43,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:20:43,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2020-07-28 17:20:43,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65667001] [2020-07-28 17:20:43,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-28 17:20:43,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:20:43,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:20:43,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:43,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:20:43,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:20:43,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:20:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:20:43,730 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 5 states. [2020-07-28 17:20:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:45,906 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-07-28 17:20:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:20:45,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-28 17:20:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:20:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:20:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-07-28 17:20:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:20:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-07-28 17:20:45,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2020-07-28 17:20:45,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:20:45,947 INFO L225 Difference]: With dead ends: 24 [2020-07-28 17:20:45,947 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:20:45,948 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:20:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:20:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:20:45,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:20:45,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:20:45,949 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:20:45,949 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:20:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:45,950 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:20:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:20:45,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:45,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:45,951 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:20:45,951 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:20:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:20:45,951 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:20:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:20:45,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:45,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:20:45,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:20:45,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:20:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:20:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:20:45,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-28 17:20:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:20:45,952 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:20:45,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:20:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:20:45,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:20:46,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 17:20:46,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:20:46,164 INFO L268 CegarLoopResult]: For program point L2-1(line 970) no Hoare annotation was computed. [2020-07-28 17:20:46,164 INFO L268 CegarLoopResult]: For program point L993(line 993) no Hoare annotation was computed. [2020-07-28 17:20:46,164 INFO L268 CegarLoopResult]: For program point L2-2(line 977) no Hoare annotation was computed. [2020-07-28 17:20:46,164 INFO L268 CegarLoopResult]: For program point L2-3(line 986) no Hoare annotation was computed. [2020-07-28 17:20:46,164 INFO L268 CegarLoopResult]: For program point L2-4(line 993) no Hoare annotation was computed. [2020-07-28 17:20:46,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 987) no Hoare annotation was computed. [2020-07-28 17:20:46,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 963) no Hoare annotation was computed. [2020-07-28 17:20:46,165 INFO L268 CegarLoopResult]: For program point L977(line 977) no Hoare annotation was computed. [2020-07-28 17:20:46,165 INFO L268 CegarLoopResult]: For program point L977-2(lines 957 994) no Hoare annotation was computed. [2020-07-28 17:20:46,165 INFO L268 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-07-28 17:20:46,166 INFO L268 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-07-28 17:20:46,166 INFO L268 CegarLoopResult]: For program point L3-4(line 3) no Hoare annotation was computed. [2020-07-28 17:20:46,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 971) no Hoare annotation was computed. [2020-07-28 17:20:46,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:20:46,166 INFO L268 CegarLoopResult]: For program point L3-6(line 3) no Hoare annotation was computed. [2020-07-28 17:20:46,166 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:20:46,166 INFO L268 CegarLoopResult]: For program point L3-8(line 3) no Hoare annotation was computed. [2020-07-28 17:20:46,167 INFO L268 CegarLoopResult]: For program point L986(line 986) no Hoare annotation was computed. [2020-07-28 17:20:46,167 INFO L268 CegarLoopResult]: For program point L986-2(lines 957 994) no Hoare annotation was computed. [2020-07-28 17:20:46,167 INFO L268 CegarLoopResult]: For program point L978(line 978) no Hoare annotation was computed. [2020-07-28 17:20:46,167 INFO L268 CegarLoopResult]: For program point L978-2(lines 957 994) no Hoare annotation was computed. [2020-07-28 17:20:46,168 INFO L268 CegarLoopResult]: For program point L970(line 970) no Hoare annotation was computed. [2020-07-28 17:20:46,168 INFO L268 CegarLoopResult]: For program point L970-2(lines 957 994) no Hoare annotation was computed. [2020-07-28 17:20:46,168 INFO L268 CegarLoopResult]: For program point L962(line 962) no Hoare annotation was computed. [2020-07-28 17:20:46,168 INFO L268 CegarLoopResult]: For program point L962-2(lines 957 994) no Hoare annotation was computed. [2020-07-28 17:20:46,168 INFO L268 CegarLoopResult]: For program point L987(line 987) no Hoare annotation was computed. [2020-07-28 17:20:46,168 INFO L268 CegarLoopResult]: For program point L987-2(line 987) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 970) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point L979(line 979) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point L979-2(line 979) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point L971(line 971) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point L971-2(line 971) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point L963(line 963) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point L963-2(lines 957 994) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 978) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point L964(line 964) no Hoare annotation was computed. [2020-07-28 17:20:46,169 INFO L268 CegarLoopResult]: For program point L964-2(line 964) no Hoare annotation was computed. [2020-07-28 17:20:46,170 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 977) no Hoare annotation was computed. [2020-07-28 17:20:46,170 INFO L268 CegarLoopResult]: For program point L956(lines 956 994) no Hoare annotation was computed. [2020-07-28 17:20:46,170 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:20:46,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 986) no Hoare annotation was computed. [2020-07-28 17:20:46,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 962) no Hoare annotation was computed. [2020-07-28 17:20:46,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:20:46,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 979) no Hoare annotation was computed. [2020-07-28 17:20:46,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 993) no Hoare annotation was computed. [2020-07-28 17:20:46,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 964) no Hoare annotation was computed. [2020-07-28 17:20:46,171 INFO L268 CegarLoopResult]: For program point L2(line 962) no Hoare annotation was computed. [2020-07-28 17:20:46,176 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:20:46,176 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:20:46,176 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-28 17:20:46,176 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-28 17:20:46,176 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-28 17:20:46,176 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L962 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L962 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L962-2 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L962-2 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L963 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L963 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L963-2 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L963-2 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L964 has no Hoare annotation [2020-07-28 17:20:46,177 WARN L170 areAnnotationChecker]: L964 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L964-2 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L970 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L970 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L970-2 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L970-2 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L971 has no Hoare annotation [2020-07-28 17:20:46,178 WARN L170 areAnnotationChecker]: L971 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L971-2 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L3-4 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L3-4 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L2-2 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L2-2 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L977 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L977 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L977-2 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L977-2 has no Hoare annotation [2020-07-28 17:20:46,179 WARN L170 areAnnotationChecker]: L978 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L978 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L978-2 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L978-2 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L979 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L979 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L979-2 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L3-6 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L3-6 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L2-3 has no Hoare annotation [2020-07-28 17:20:46,180 WARN L170 areAnnotationChecker]: L2-3 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L986 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L986-2 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L986-2 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L987 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L987 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L987-2 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L3-8 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L3-8 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L2-4 has no Hoare annotation [2020-07-28 17:20:46,181 WARN L170 areAnnotationChecker]: L2-4 has no Hoare annotation [2020-07-28 17:20:46,182 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-28 17:20:46,182 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-28 17:20:46,182 WARN L170 areAnnotationChecker]: L956 has no Hoare annotation [2020-07-28 17:20:46,182 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:20:46,182 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:20:46,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:20:46 BoogieIcfgContainer [2020-07-28 17:20:46,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:20:46,185 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:20:46,185 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:20:46,186 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:20:46,186 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:20:38" (3/4) ... [2020-07-28 17:20:46,189 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:20:46,202 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-07-28 17:20:46,202 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 17:20:46,202 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:20:46,266 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:20:46,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:20:46,268 INFO L168 Benchmark]: Toolchain (without parser) took 9463.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 952.2 MB in the beginning and 911.2 MB in the end (delta: 41.0 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:20:46,269 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:20:46,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1166.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -72.1 MB). Peak memory consumption was 79.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:20:46,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:20:46,270 INFO L168 Benchmark]: Boogie Preprocessor took 32.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:20:46,271 INFO L168 Benchmark]: RCFGBuilder took 499.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:20:46,272 INFO L168 Benchmark]: TraceAbstraction took 7603.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 993.6 MB in the beginning and 918.9 MB in the end (delta: 74.7 MB). Peak memory consumption was 141.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:20:46,272 INFO L168 Benchmark]: Witness Printer took 80.66 ms. Allocated memory is still 1.2 GB. Free memory was 918.9 MB in the beginning and 911.2 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:20:46,279 INFO L336 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1166.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -72.1 MB). Peak memory consumption was 79.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 499.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.6 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7603.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 993.6 MB in the beginning and 918.9 MB in the end (delta: 74.7 MB). Peak memory consumption was 141.8 MB. Max. memory is 11.5 GB. * Witness Printer took 80.66 ms. Allocated memory is still 1.2 GB. Free memory was 918.9 MB in the beginning and 911.2 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 963]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 986]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 971]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 979]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 977]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 978]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 970]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 962]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 964]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 987]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.5s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 172 SDtfs, 161 SDslu, 139 SDs, 0 SdLazy, 76 SolverSat, 6 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 4448 SizeOfPredicates, 15 NumberOfNonLiveVariables, 136 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...