./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 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float-no-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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3d8fd51b47ba78ffa0ce38d0a5a9796d128a31f69295c1dd841ff5db63ed4f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:20:00,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:20:00,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:20:00,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:20:00,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:20:00,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:20:00,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:20:00,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:20:00,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:20:00,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:20:00,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:20:00,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:20:00,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:20:01,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:20:01,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:20:01,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:20:01,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:20:01,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:20:01,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:20:01,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:20:01,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:20:01,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:20:01,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:20:01,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:20:01,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:20:01,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:20:01,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:20:01,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:20:01,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:20:01,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:20:01,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:20:01,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:20:01,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:20:01,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:20:01,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:20:01,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:20:01,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:20:01,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:20:01,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:20:01,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:20:01,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:20:01,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:20:01,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:20:01,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:20:01,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:20:01,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:20:01,038 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:20:01,039 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:20:01,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:20:01,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:20:01,039 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:20:01,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:20:01,040 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:20:01,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:20:01,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:20:01,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:20:01,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:20:01,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:20:01,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:20:01,041 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:20:01,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:20:01,042 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:20:01,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:20:01,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:20:01,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:20:01,042 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:20:01,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:20:01,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:20:01,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:20:01,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:20:01,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:20:01,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:20:01,044 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:20:01,044 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:20:01,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:20:01,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3d8fd51b47ba78ffa0ce38d0a5a9796d128a31f69295c1dd841ff5db63ed4f4 [2022-02-20 16:20:01,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:20:01,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:20:01,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:20:01,418 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:20:01,419 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:20:01,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i [2022-02-20 16:20:01,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df131c94/0f94c568165d4865a146bf3e1917dbfd/FLAGa3966856b [2022-02-20 16:20:01,939 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:20:01,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i [2022-02-20 16:20:01,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df131c94/0f94c568165d4865a146bf3e1917dbfd/FLAGa3966856b [2022-02-20 16:20:02,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7df131c94/0f94c568165d4865a146bf3e1917dbfd [2022-02-20 16:20:02,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:20:02,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:20:02,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:20:02,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:20:02,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:20:02,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:20:02" (1/1) ... [2022-02-20 16:20:02,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d52863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:02, skipping insertion in model container [2022-02-20 16:20:02,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:20:02" (1/1) ... [2022-02-20 16:20:02,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:20:02,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:20:02,663 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:848) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:1792) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:235) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1442) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2407) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:728) 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:2407) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1449) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1076) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1465) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2356) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:20:02,668 INFO L158 Benchmark]: Toolchain (without parser) took 456.39ms. Allocated memory is still 130.0MB. Free memory was 101.1MB in the beginning and 99.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:20:02,670 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:20:02,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.78ms. Allocated memory is still 130.0MB. Free memory was 101.1MB in the beginning and 99.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:20:02,672 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.78ms. Allocated memory is still 130.0MB. Free memory was 101.1MB in the beginning and 99.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: 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:848) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float-no-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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3d8fd51b47ba78ffa0ce38d0a5a9796d128a31f69295c1dd841ff5db63ed4f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:20:04,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:20:04,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:20:04,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:20:04,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:20:04,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:20:04,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:20:04,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:20:04,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:20:04,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:20:04,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:20:04,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:20:04,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:20:04,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:20:04,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:20:04,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:20:04,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:20:04,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:20:04,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:20:04,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:20:04,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:20:04,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:20:04,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:20:04,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:20:04,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:20:04,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:20:04,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:20:04,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:20:04,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:20:04,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:20:04,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:20:04,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:20:04,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:20:04,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:20:04,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:20:04,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:20:04,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:20:04,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:20:04,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:20:04,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:20:04,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:20:04,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:20:04,406 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:20:04,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:20:04,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:20:04,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:20:04,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:20:04,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:20:04,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:20:04,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:20:04,409 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:20:04,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:20:04,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:20:04,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:20:04,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:20:04,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:20:04,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:20:04,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:20:04,410 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:20:04,411 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:20:04,411 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:20:04,411 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:20:04,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:20:04,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:20:04,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:20:04,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:20:04,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:20:04,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:20:04,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:20:04,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:20:04,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:20:04,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:20:04,412 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:20:04,413 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:20:04,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:20:04,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:20:04,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:20:04,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:20:04,413 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3d8fd51b47ba78ffa0ce38d0a5a9796d128a31f69295c1dd841ff5db63ed4f4 [2022-02-20 16:20:04,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:20:04,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:20:04,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:20:04,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:20:04,664 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:20:04,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i [2022-02-20 16:20:04,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa509c34/fd119feb421b4ba69bbb6347256932a2/FLAGb3746ad02 [2022-02-20 16:20:05,169 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:20:05,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i [2022-02-20 16:20:05,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa509c34/fd119feb421b4ba69bbb6347256932a2/FLAGb3746ad02 [2022-02-20 16:20:05,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fa509c34/fd119feb421b4ba69bbb6347256932a2 [2022-02-20 16:20:05,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:20:05,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:20:05,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:20:05,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:20:05,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:20:05,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:20:05" (1/1) ... [2022-02-20 16:20:05,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301855ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:05, skipping insertion in model container [2022-02-20 16:20:05,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:20:05" (1/1) ... [2022-02-20 16:20:05,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:20:05,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:20:06,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41149,41162] [2022-02-20 16:20:06,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41296,41309] [2022-02-20 16:20:06,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41445,41458] [2022-02-20 16:20:06,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41846,41859] [2022-02-20 16:20:06,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41993,42006] [2022-02-20 16:20:06,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[42394,42407] [2022-02-20 16:20:06,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[42541,42554] [2022-02-20 16:20:06,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[42582,42595] [2022-02-20 16:20:06,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[42965,42978] [2022-02-20 16:20:06,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[43112,43125] [2022-02-20 16:20:06,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[43610,43623] [2022-02-20 16:20:06,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:20:06,180 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:20:06,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41149,41162] [2022-02-20 16:20:06,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41296,41309] [2022-02-20 16:20:06,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41445,41458] [2022-02-20 16:20:06,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41846,41859] [2022-02-20 16:20:06,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[41993,42006] [2022-02-20 16:20:06,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[42394,42407] [2022-02-20 16:20:06,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[42541,42554] [2022-02-20 16:20:06,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[42582,42595] [2022-02-20 16:20:06,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[42965,42978] [2022-02-20 16:20:06,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[43112,43125] [2022-02-20 16:20:06,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-no-simp4.i[43610,43623] [2022-02-20 16:20:06,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:20:06,313 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:20:06,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06 WrapperNode [2022-02-20 16:20:06,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:20:06,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:20:06,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:20:06,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:20:06,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,374 INFO L137 Inliner]: procedures = 449, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 73 [2022-02-20 16:20:06,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:20:06,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:20:06,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:20:06,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:20:06,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:20:06,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:20:06,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:20:06,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:20:06,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (1/1) ... [2022-02-20 16:20:06,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:20:06,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:20:06,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:20:06,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:20:06,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:20:06,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:20:06,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:20:06,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:20:06,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 16:20:06,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 16:20:06,514 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:20:06,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:20:06,669 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:20:06,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:20:06,684 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:20:06,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:06 BoogieIcfgContainer [2022-02-20 16:20:06,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:20:06,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:20:06,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:20:06,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:20:06,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:20:05" (1/3) ... [2022-02-20 16:20:06,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc6169c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:20:06, skipping insertion in model container [2022-02-20 16:20:06,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:06" (2/3) ... [2022-02-20 16:20:06,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc6169c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:20:06, skipping insertion in model container [2022-02-20 16:20:06,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:06" (3/3) ... [2022-02-20 16:20:06,691 INFO L111 eAbstractionObserver]: Analyzing ICFG float-no-simp4.i [2022-02-20 16:20:06,694 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:20:06,707 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-02-20 16:20:06,739 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:20:06,745 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:20:06,745 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-02-20 16:20:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.696969696969697) internal successors, (56), 44 states have internal predecessors, (56), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:20:06,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:06,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:06,775 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 16:20:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 855794161, now seen corresponding path program 1 times [2022-02-20 16:20:06,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:06,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751587270] [2022-02-20 16:20:06,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:06,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:06,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:06,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:06,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:20:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:06,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:20:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:06,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:06,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {54#true} is VALID [2022-02-20 16:20:06,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_#t~nondet86#1, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~nondet90#1, main_#t~nondet91#1, main_#t~nondet92#1, main_#t~nondet93#1, main_#t~nondet94#1, main_~d1~0#1, main_~_d1~0#1, main_~d2~0#1, main_~_d2~0#1, main_~d3~0#1, main_~_d3~0#1, main_~d4~0#1, main_~_d4~0#1, main_~d5~0#1, main_~_d5~0#1;main_~d1~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~_d1~0#1 := main_#t~nondet86#1;havoc main_#t~nondet86#1;main_~d1~0#1 := main_~_d1~0#1; {54#true} is VALID [2022-02-20 16:20:06,902 INFO L272 TraceCheckUtils]: 2: Hoare triple {54#true} call assume_abort_if_not((if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0#1) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32)); {54#true} is VALID [2022-02-20 16:20:06,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {54#true} ~cond := #in~cond; {54#true} is VALID [2022-02-20 16:20:06,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {54#true} assume 0bv32 == ~cond;assume false; {55#false} is VALID [2022-02-20 16:20:06,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {55#false} assume true; {55#false} is VALID [2022-02-20 16:20:06,903 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55#false} {54#true} #111#return; {55#false} is VALID [2022-02-20 16:20:06,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {55#false} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {55#false} is VALID [2022-02-20 16:20:06,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-02-20 16:20:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:06,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:06,905 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:06,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751587270] [2022-02-20 16:20:06,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751587270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:06,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:06,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:20:06,907 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060018480] [2022-02-20 16:20:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:06,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-02-20 16:20:06,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:06,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:06,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:06,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:20:06,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:20:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:20:06,943 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.696969696969697) internal successors, (56), 44 states have internal predecessors, (56), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:07,002 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2022-02-20 16:20:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:20:07,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-02-20 16:20:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 133 transitions. [2022-02-20 16:20:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 133 transitions. [2022-02-20 16:20:07,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 133 transitions. [2022-02-20 16:20:07,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:07,133 INFO L225 Difference]: With dead ends: 99 [2022-02-20 16:20:07,133 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 16:20:07,135 INFO L932 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 [2022-02-20 16:20:07,137 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:07,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:20:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 16:20:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 16:20:07,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:07,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:07,166 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:07,166 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:07,172 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-02-20 16:20:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-02-20 16:20:07,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:07,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:07,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 48 states. [2022-02-20 16:20:07,174 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 48 states. [2022-02-20 16:20:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:07,179 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-02-20 16:20:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-02-20 16:20:07,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:07,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:07,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:07,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-02-20 16:20:07,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 9 [2022-02-20 16:20:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:07,186 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-02-20 16:20:07,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-02-20 16:20:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:20:07,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:07,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:07,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:07,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:07,396 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 16:20:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash 857641203, now seen corresponding path program 1 times [2022-02-20 16:20:07,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:07,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838225137] [2022-02-20 16:20:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:07,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:07,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:07,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:07,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:20:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:07,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:20:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:07,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:08,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {342#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {342#true} is VALID [2022-02-20 16:20:08,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_#t~nondet86#1, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~nondet90#1, main_#t~nondet91#1, main_#t~nondet92#1, main_#t~nondet93#1, main_#t~nondet94#1, main_~d1~0#1, main_~_d1~0#1, main_~d2~0#1, main_~_d2~0#1, main_~d3~0#1, main_~_d3~0#1, main_~d4~0#1, main_~_d4~0#1, main_~d5~0#1, main_~_d5~0#1;main_~d1~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~_d1~0#1 := main_#t~nondet86#1;havoc main_#t~nondet86#1;main_~d1~0#1 := main_~_d1~0#1; {342#true} is VALID [2022-02-20 16:20:08,877 INFO L272 TraceCheckUtils]: 2: Hoare triple {342#true} call assume_abort_if_not((if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0#1) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32)); {342#true} is VALID [2022-02-20 16:20:08,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {342#true} ~cond := #in~cond; {356#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 16:20:08,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {356#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {360#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:08,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {360#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:08,879 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {360#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {342#true} #111#return; {367#(fp.isNormal |ULTIMATE.start_main_~d1~0#1|)} is VALID [2022-02-20 16:20:08,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {367#(fp.isNormal |ULTIMATE.start_main_~d1~0#1|)} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {343#false} is VALID [2022-02-20 16:20:08,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {343#false} assume !false; {343#false} is VALID [2022-02-20 16:20:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:08,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:08,882 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:08,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838225137] [2022-02-20 16:20:08,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838225137] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:08,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:08,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:20:08,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911806576] [2022-02-20 16:20:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:08,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-02-20 16:20:08,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:08,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:08,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:08,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:20:08,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:20:08,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:20:08,899 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:09,107 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-02-20 16:20:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:20:09,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-02-20 16:20:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 16:20:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 16:20:09,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-20 16:20:09,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:09,169 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:20:09,169 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 16:20:09,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:20:09,170 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:09,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 102 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:20:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 16:20:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 16:20:09,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:09,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:09,177 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:09,178 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:09,183 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-02-20 16:20:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-02-20 16:20:09,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:09,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:09,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-02-20 16:20:09,185 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-02-20 16:20:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:09,189 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-02-20 16:20:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-02-20 16:20:09,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:09,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:09,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:09,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-02-20 16:20:09,194 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 9 [2022-02-20 16:20:09,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:09,195 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-02-20 16:20:09,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:20:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-02-20 16:20:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:20:09,196 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:09,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:09,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:09,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:09,405 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 16:20:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1222120034, now seen corresponding path program 1 times [2022-02-20 16:20:09,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:09,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201484748] [2022-02-20 16:20:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:09,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:09,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:09,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:09,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:20:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:09,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:20:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:09,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:09,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {561#true} is VALID [2022-02-20 16:20:09,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_#t~nondet86#1, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~nondet90#1, main_#t~nondet91#1, main_#t~nondet92#1, main_#t~nondet93#1, main_#t~nondet94#1, main_~d1~0#1, main_~_d1~0#1, main_~d2~0#1, main_~_d2~0#1, main_~d3~0#1, main_~_d3~0#1, main_~d4~0#1, main_~_d4~0#1, main_~d5~0#1, main_~_d5~0#1;main_~d1~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~_d1~0#1 := main_#t~nondet86#1;havoc main_#t~nondet86#1;main_~d1~0#1 := main_~_d1~0#1; {561#true} is VALID [2022-02-20 16:20:09,561 INFO L272 TraceCheckUtils]: 2: Hoare triple {561#true} call assume_abort_if_not((if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0#1) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32)); {561#true} is VALID [2022-02-20 16:20:09,561 INFO L290 TraceCheckUtils]: 3: Hoare triple {561#true} ~cond := #in~cond; {561#true} is VALID [2022-02-20 16:20:09,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {561#true} assume !(0bv32 == ~cond); {561#true} is VALID [2022-02-20 16:20:09,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {561#true} assume true; {561#true} is VALID [2022-02-20 16:20:09,562 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {561#true} {561#true} #111#return; {561#true} is VALID [2022-02-20 16:20:09,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {561#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {561#true} is VALID [2022-02-20 16:20:09,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {561#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {561#true} is VALID [2022-02-20 16:20:09,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {561#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0#1) || ~fp.isSubnormal~DOUBLE(main_~d1~0#1)) || ~fp.isZero~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {561#true} is VALID [2022-02-20 16:20:09,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {561#true} main_~d2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~_d2~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~d2~0#1 := main_~_d2~0#1; {561#true} is VALID [2022-02-20 16:20:09,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {561#true} call assume_abort_if_not((if ~fp.isInfinite~DOUBLE(main_~d2~0#1) then 1bv32 else 0bv32)); {561#true} is VALID [2022-02-20 16:20:09,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#true} ~cond := #in~cond; {602#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 16:20:09,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {602#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {606#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:09,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {606#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {606#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:09,578 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {606#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {561#true} #113#return; {613#(fp.isInfinite |ULTIMATE.start_main_~d2~0#1|)} is VALID [2022-02-20 16:20:09,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {613#(fp.isInfinite |ULTIMATE.start_main_~d2~0#1|)} assume !!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0#1) then 3bv32 else 2bv32))))); {562#false} is VALID [2022-02-20 16:20:09,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {562#false} assume !false; {562#false} is VALID [2022-02-20 16:20:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:20:09,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:09,579 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:09,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201484748] [2022-02-20 16:20:09,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201484748] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:09,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:09,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:20:09,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078712889] [2022-02-20 16:20:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:09,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 16:20:09,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:09,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:09,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:09,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:20:09,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:09,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:20:09,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:20:09,598 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:09,800 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-02-20 16:20:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:20:09,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 16:20:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 16:20:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 16:20:09,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 16:20:09,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:09,841 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:20:09,841 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:20:09,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:20:09,842 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:09,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 96 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:20:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:20:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 16:20:09,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:09,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:09,847 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:09,847 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:09,848 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-20 16:20:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-02-20 16:20:09,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:09,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:09,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-02-20 16:20:09,850 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-02-20 16:20:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:09,851 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-20 16:20:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-02-20 16:20:09,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:09,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:09,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:09,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-02-20 16:20:09,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 18 [2022-02-20 16:20:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:09,854 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-02-20 16:20:09,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:20:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-02-20 16:20:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 16:20:09,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:09,855 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:09,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:20:10,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:10,063 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 16:20:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1704996651, now seen corresponding path program 1 times [2022-02-20 16:20:10,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:10,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106178912] [2022-02-20 16:20:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:10,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:10,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:10,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:20:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:10,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:20:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:10,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:10,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {789#true} is VALID [2022-02-20 16:20:10,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_#t~nondet86#1, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~nondet90#1, main_#t~nondet91#1, main_#t~nondet92#1, main_#t~nondet93#1, main_#t~nondet94#1, main_~d1~0#1, main_~_d1~0#1, main_~d2~0#1, main_~_d2~0#1, main_~d3~0#1, main_~_d3~0#1, main_~d4~0#1, main_~_d4~0#1, main_~d5~0#1, main_~_d5~0#1;main_~d1~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~_d1~0#1 := main_#t~nondet86#1;havoc main_#t~nondet86#1;main_~d1~0#1 := main_~_d1~0#1; {789#true} is VALID [2022-02-20 16:20:10,225 INFO L272 TraceCheckUtils]: 2: Hoare triple {789#true} call assume_abort_if_not((if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0#1) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32)); {789#true} is VALID [2022-02-20 16:20:10,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {789#true} ~cond := #in~cond; {789#true} is VALID [2022-02-20 16:20:10,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {789#true} assume !(0bv32 == ~cond); {789#true} is VALID [2022-02-20 16:20:10,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#true} assume true; {789#true} is VALID [2022-02-20 16:20:10,226 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {789#true} {789#true} #111#return; {789#true} is VALID [2022-02-20 16:20:10,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {789#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {789#true} is VALID [2022-02-20 16:20:10,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {789#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {789#true} is VALID [2022-02-20 16:20:10,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {789#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0#1) || ~fp.isSubnormal~DOUBLE(main_~d1~0#1)) || ~fp.isZero~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {789#true} is VALID [2022-02-20 16:20:10,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {789#true} main_~d2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~_d2~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~d2~0#1 := main_~_d2~0#1; {789#true} is VALID [2022-02-20 16:20:10,226 INFO L272 TraceCheckUtils]: 11: Hoare triple {789#true} call assume_abort_if_not((if ~fp.isInfinite~DOUBLE(main_~d2~0#1) then 1bv32 else 0bv32)); {789#true} is VALID [2022-02-20 16:20:10,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {789#true} ~cond := #in~cond; {789#true} is VALID [2022-02-20 16:20:10,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {789#true} assume !(0bv32 == ~cond); {789#true} is VALID [2022-02-20 16:20:10,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {789#true} assume true; {789#true} is VALID [2022-02-20 16:20:10,227 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {789#true} {789#true} #113#return; {789#true} is VALID [2022-02-20 16:20:10,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {789#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0#1) then 3bv32 else 2bv32))))); {789#true} is VALID [2022-02-20 16:20:10,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {789#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0#1) then 1bv32 else 0bv32)); {789#true} is VALID [2022-02-20 16:20:10,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {789#true} main_~d3~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~_d3~0#1 := main_#t~nondet90#1;havoc main_#t~nondet90#1;main_~d3~0#1 := main_~_d3~0#1; {789#true} is VALID [2022-02-20 16:20:10,228 INFO L272 TraceCheckUtils]: 19: Hoare triple {789#true} call assume_abort_if_not((if ~fp.isNaN~DOUBLE(main_~d3~0#1) then 1bv32 else 0bv32)); {789#true} is VALID [2022-02-20 16:20:10,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {789#true} ~cond := #in~cond; {854#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 16:20:10,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {854#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {858#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:10,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {858#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {858#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:10,230 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {858#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {789#true} #115#return; {865#(fp.isNaN |ULTIMATE.start_main_~d3~0#1|)} is VALID [2022-02-20 16:20:10,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {865#(fp.isNaN |ULTIMATE.start_main_~d3~0#1|)} assume !!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0#1) then 3bv32 else 2bv32))))); {790#false} is VALID [2022-02-20 16:20:10,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {790#false} assume !false; {790#false} is VALID [2022-02-20 16:20:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:20:10,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:10,231 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:10,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106178912] [2022-02-20 16:20:10,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106178912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:10,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:10,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:20:10,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276507175] [2022-02-20 16:20:10,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 16:20:10,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:10,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:20:10,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:10,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:20:10,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:10,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:20:10,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:20:10,251 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:20:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:10,465 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-20 16:20:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:20:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 16:20:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:20:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:20:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:20:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:20:10,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:20:10,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:10,503 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:20:10,504 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:20:10,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:20:10,504 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:10,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:20:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:20:10,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 16:20:10,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:10,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:10,521 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:10,522 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:10,523 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 16:20:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 16:20:10,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:10,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:10,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-02-20 16:20:10,524 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-02-20 16:20:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:10,525 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 16:20:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 16:20:10,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:10,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:10,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:10,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-02-20 16:20:10,527 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 26 [2022-02-20 16:20:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:10,527 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-02-20 16:20:10,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:20:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 16:20:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:20:10,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:10,528 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:10,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:10,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:10,737 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 16:20:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash -826066940, now seen corresponding path program 1 times [2022-02-20 16:20:10,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:10,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502223280] [2022-02-20 16:20:10,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:10,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:10,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:10,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:10,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:20:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:10,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:20:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:10,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:10,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {1019#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {1019#true} is VALID [2022-02-20 16:20:10,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_#t~nondet86#1, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~nondet90#1, main_#t~nondet91#1, main_#t~nondet92#1, main_#t~nondet93#1, main_#t~nondet94#1, main_~d1~0#1, main_~_d1~0#1, main_~d2~0#1, main_~_d2~0#1, main_~d3~0#1, main_~_d3~0#1, main_~d4~0#1, main_~_d4~0#1, main_~d5~0#1, main_~_d5~0#1;main_~d1~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~_d1~0#1 := main_#t~nondet86#1;havoc main_#t~nondet86#1;main_~d1~0#1 := main_~_d1~0#1; {1019#true} is VALID [2022-02-20 16:20:10,856 INFO L272 TraceCheckUtils]: 2: Hoare triple {1019#true} call assume_abort_if_not((if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0#1) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {1019#true} ~cond := #in~cond; {1019#true} is VALID [2022-02-20 16:20:10,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {1019#true} assume !(0bv32 == ~cond); {1019#true} is VALID [2022-02-20 16:20:10,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {1019#true} assume true; {1019#true} is VALID [2022-02-20 16:20:10,857 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1019#true} {1019#true} #111#return; {1019#true} is VALID [2022-02-20 16:20:10,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {1019#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {1019#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {1019#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0#1) || ~fp.isSubnormal~DOUBLE(main_~d1~0#1)) || ~fp.isZero~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {1019#true} main_~d2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~_d2~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~d2~0#1 := main_~_d2~0#1; {1019#true} is VALID [2022-02-20 16:20:10,857 INFO L272 TraceCheckUtils]: 11: Hoare triple {1019#true} call assume_abort_if_not((if ~fp.isInfinite~DOUBLE(main_~d2~0#1) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {1019#true} ~cond := #in~cond; {1019#true} is VALID [2022-02-20 16:20:10,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {1019#true} assume !(0bv32 == ~cond); {1019#true} is VALID [2022-02-20 16:20:10,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {1019#true} assume true; {1019#true} is VALID [2022-02-20 16:20:10,858 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1019#true} {1019#true} #113#return; {1019#true} is VALID [2022-02-20 16:20:10,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {1019#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0#1) then 3bv32 else 2bv32))))); {1019#true} is VALID [2022-02-20 16:20:10,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {1019#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0#1) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {1019#true} main_~d3~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~_d3~0#1 := main_#t~nondet90#1;havoc main_#t~nondet90#1;main_~d3~0#1 := main_~_d3~0#1; {1019#true} is VALID [2022-02-20 16:20:10,859 INFO L272 TraceCheckUtils]: 19: Hoare triple {1019#true} call assume_abort_if_not((if ~fp.isNaN~DOUBLE(main_~d3~0#1) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {1019#true} ~cond := #in~cond; {1019#true} is VALID [2022-02-20 16:20:10,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {1019#true} assume !(0bv32 == ~cond); {1019#true} is VALID [2022-02-20 16:20:10,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {1019#true} assume true; {1019#true} is VALID [2022-02-20 16:20:10,859 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1019#true} {1019#true} #115#return; {1019#true} is VALID [2022-02-20 16:20:10,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {1019#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0#1) then 3bv32 else 2bv32))))); {1019#true} is VALID [2022-02-20 16:20:10,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {1019#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0#1) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {1019#true} assume !!!~fp.eq~DOUBLE(main_~d3~0#1, main_~d3~0#1); {1019#true} is VALID [2022-02-20 16:20:10,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#true} main_~d4~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_~_d4~0#1 := main_#t~nondet92#1;havoc main_#t~nondet92#1;main_~d4~0#1 := main_~_d4~0#1; {1019#true} is VALID [2022-02-20 16:20:10,860 INFO L272 TraceCheckUtils]: 28: Hoare triple {1019#true} call assume_abort_if_not((if (~fp.isNormal~DOUBLE(main_~d4~0#1) || ~fp.isSubnormal~DOUBLE(main_~d4~0#1)) || ~fp.isZero~DOUBLE(main_~d4~0#1) then 1bv32 else 0bv32)); {1019#true} is VALID [2022-02-20 16:20:10,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {1019#true} ~cond := #in~cond; {1111#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 16:20:10,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {1111#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {1115#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:10,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {1115#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {1115#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:10,862 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1115#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {1019#true} #117#return; {1122#(or (fp.isNormal |ULTIMATE.start_main_~d4~0#1|) (fp.isSubnormal |ULTIMATE.start_main_~d4~0#1|) (fp.isZero |ULTIMATE.start_main_~d4~0#1|))} is VALID [2022-02-20 16:20:10,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {1122#(or (fp.isNormal |ULTIMATE.start_main_~d4~0#1|) (fp.isSubnormal |ULTIMATE.start_main_~d4~0#1|) (fp.isZero |ULTIMATE.start_main_~d4~0#1|))} assume !(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d4~0#1) then 1bv32 else 0bv32)); {1020#false} is VALID [2022-02-20 16:20:10,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {1020#false} assume !false; {1020#false} is VALID [2022-02-20 16:20:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:20:10,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:10,863 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:10,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502223280] [2022-02-20 16:20:10,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502223280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:10,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:10,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:20:10,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216079818] [2022-02-20 16:20:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:10,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-02-20 16:20:10,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:10,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:20:10,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:10,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:20:10,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:10,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:20:10,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:20:10,884 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:20:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:11,058 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 16:20:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:20:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-02-20 16:20:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:20:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 16:20:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:20:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-02-20 16:20:11,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-02-20 16:20:11,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:11,095 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:20:11,095 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:20:11,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:20:11,096 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:11,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 73 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:20:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:20:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 16:20:11,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:11,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:11,098 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:11,099 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:11,100 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 16:20:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 16:20:11,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:11,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:11,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 16:20:11,100 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 16:20:11,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:11,101 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 16:20:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 16:20:11,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:11,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:11,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:11,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:20:11,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-02-20 16:20:11,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 35 [2022-02-20 16:20:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:11,103 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-02-20 16:20:11,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 16:20:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 16:20:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 16:20:11,104 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:11,105 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:11,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:11,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:11,313 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-02-20 16:20:11,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1889668375, now seen corresponding path program 1 times [2022-02-20 16:20:11,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:11,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791155848] [2022-02-20 16:20:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:11,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:11,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:11,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:20:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:11,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:20:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:11,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:11,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {1258#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(17bv32, 2bv32); {1258#true} is VALID [2022-02-20 16:20:11,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet85#1, main_#t~nondet86#1, main_#t~nondet87#1, main_#t~nondet88#1, main_#t~nondet89#1, main_#t~nondet90#1, main_#t~nondet91#1, main_#t~nondet92#1, main_#t~nondet93#1, main_#t~nondet94#1, main_~d1~0#1, main_~_d1~0#1, main_~d2~0#1, main_~_d2~0#1, main_~d3~0#1, main_~_d3~0#1, main_~d4~0#1, main_~_d4~0#1, main_~d5~0#1, main_~_d5~0#1;main_~d1~0#1 := main_#t~nondet85#1;havoc main_#t~nondet85#1;main_~_d1~0#1 := main_#t~nondet86#1;havoc main_#t~nondet86#1;main_~d1~0#1 := main_~_d1~0#1; {1258#true} is VALID [2022-02-20 16:20:11,477 INFO L272 TraceCheckUtils]: 2: Hoare triple {1258#true} call assume_abort_if_not((if 4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d1~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d1~0#1) then 3bv32 else 2bv32)))) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {1258#true} assume !(0bv32 == ~cond); {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1258#true} {1258#true} #111#return; {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {1258#true} assume !(0bv32 == (if (~fp.isNormal~DOUBLE(main_~d1~0#1) || ~fp.isSubnormal~DOUBLE(main_~d1~0#1)) || ~fp.isZero~DOUBLE(main_~d1~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {1258#true} main_~d2~0#1 := main_#t~nondet87#1;havoc main_#t~nondet87#1;main_~_d2~0#1 := main_#t~nondet88#1;havoc main_#t~nondet88#1;main_~d2~0#1 := main_~_d2~0#1; {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L272 TraceCheckUtils]: 11: Hoare triple {1258#true} call assume_abort_if_not((if ~fp.isInfinite~DOUBLE(main_~d2~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-02-20 16:20:11,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#true} assume !(0bv32 == ~cond); {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1258#true} {1258#true} #113#return; {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {1258#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d2~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d2~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d2~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d2~0#1) then 3bv32 else 2bv32))))); {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {1258#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d2~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#true} main_~d3~0#1 := main_#t~nondet89#1;havoc main_#t~nondet89#1;main_~_d3~0#1 := main_#t~nondet90#1;havoc main_#t~nondet90#1;main_~d3~0#1 := main_~_d3~0#1; {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L272 TraceCheckUtils]: 19: Hoare triple {1258#true} call assume_abort_if_not((if ~fp.isNaN~DOUBLE(main_~d3~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {1258#true} assume !(0bv32 == ~cond); {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-02-20 16:20:11,479 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1258#true} {1258#true} #115#return; {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {1258#true} assume !!!(4bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0#1) then 1bv32 else (if ~fp.isNaN~DOUBLE(main_~d3~0#1) then 0bv32 else (if ~fp.isNormal~DOUBLE(main_~d3~0#1) then 4bv32 else (if ~fp.isSubnormal~DOUBLE(main_~d3~0#1) then 3bv32 else 2bv32))))); {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d3~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {1258#true} assume !!!~fp.eq~DOUBLE(main_~d3~0#1, main_~d3~0#1); {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {1258#true} main_~d4~0#1 := main_#t~nondet91#1;havoc main_#t~nondet91#1;main_~_d4~0#1 := main_#t~nondet92#1;havoc main_#t~nondet92#1;main_~d4~0#1 := main_~_d4~0#1; {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L272 TraceCheckUtils]: 28: Hoare triple {1258#true} call assume_abort_if_not((if (~fp.isNormal~DOUBLE(main_~d4~0#1) || ~fp.isSubnormal~DOUBLE(main_~d4~0#1)) || ~fp.isZero~DOUBLE(main_~d4~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {1258#true} assume !(0bv32 == ~cond); {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-02-20 16:20:11,480 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1258#true} {1258#true} #117#return; {1258#true} is VALID [2022-02-20 16:20:11,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {1258#true} assume !!(0bv32 == (if ~fp.isNaN~DOUBLE(main_~d4~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {1258#true} assume !!(0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d4~0#1) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {1258#true} main_~d5~0#1 := main_#t~nondet93#1;havoc main_#t~nondet93#1;main_~_d5~0#1 := main_#t~nondet94#1;havoc main_#t~nondet94#1;main_~d5~0#1 := main_~_d5~0#1; {1258#true} is VALID [2022-02-20 16:20:11,481 INFO L272 TraceCheckUtils]: 36: Hoare triple {1258#true} call assume_abort_if_not((if 0bv32 == (if ~fp.isNaN~DOUBLE(main_~d5~0#1) then 1bv32 else 0bv32) && 0bv32 == (if ~fp.isInfinite~DOUBLE(main_~d5~0#1) then 1bv32 else 0bv32) then 1bv32 else 0bv32)); {1258#true} is VALID [2022-02-20 16:20:11,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {1258#true} ~cond := #in~cond; {1374#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 16:20:11,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {1374#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {1378#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:11,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {1378#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {1378#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 16:20:11,487 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1378#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {1258#true} #119#return; {1385#(and (not (fp.isNaN |ULTIMATE.start_main_~d5~0#1|)) (not (fp.isInfinite |ULTIMATE.start_main_~d5~0#1|)))} is VALID [2022-02-20 16:20:11,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {1385#(and (not (fp.isNaN |ULTIMATE.start_main_~d5~0#1|)) (not (fp.isInfinite |ULTIMATE.start_main_~d5~0#1|)))} assume 0bv32 == (if (~fp.isNormal~DOUBLE(main_~d5~0#1) || ~fp.isSubnormal~DOUBLE(main_~d5~0#1)) || ~fp.isZero~DOUBLE(main_~d5~0#1) then 1bv32 else 0bv32); {1259#false} is VALID [2022-02-20 16:20:11,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-02-20 16:20:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 16:20:11,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:11,488 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:11,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791155848] [2022-02-20 16:20:11,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791155848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:11,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:11,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:20:11,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008296176] [2022-02-20 16:20:11,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:11,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2022-02-20 16:20:11,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:11,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 16:20:11,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:11,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:20:11,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:20:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:20:11,512 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 16:20:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:11,621 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 16:20:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:20:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2022-02-20 16:20:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 16:20:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-20 16:20:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 16:20:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-02-20 16:20:11,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-02-20 16:20:11,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:11,644 INFO L225 Difference]: With dead ends: 28 [2022-02-20 16:20:11,644 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:20:11,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:20:11,645 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:11,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:20:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:20:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:20:11,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:11,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:11,646 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:11,646 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:11,646 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:20:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:20:11,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:11,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:11,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:20:11,646 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:20:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:11,646 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:20:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:20:11,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:11,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:11,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:11,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:20:11,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-02-20 16:20:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:11,647 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:20:11,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 16:20:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:20:11,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:11,649 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2022-02-20 16:20:11,649 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2022-02-20 16:20:11,649 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2022-02-20 16:20:11,649 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2022-02-20 16:20:11,650 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2022-02-20 16:20:11,650 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2022-02-20 16:20:11,650 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2022-02-20 16:20:11,650 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2022-02-20 16:20:11,650 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2022-02-20 16:20:11,650 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2022-02-20 16:20:11,650 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2022-02-20 16:20:11,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:11,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:11,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:20:11,888 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 988) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L989(line 989) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 998) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L989-2(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 974) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L981(line 981) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L981-2(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L973(line 973) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L973-2(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L998(line 998) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L998-2(line 998) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 982) no Hoare annotation was computed. [2022-02-20 16:20:11,889 INFO L858 garLoopResultBuilder]: For program point L990(line 990) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point L990-2(line 990) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 997) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 973) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point L982(line 982) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point L982-2(line 982) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point L974(line 974) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point L974-2(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L854 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (and (fp.isNormal |ULTIMATE.start_main_~d1~0#1|) (fp.isInfinite |ULTIMATE.start_main_~d2~0#1|) (fp.isNaN |ULTIMATE.start_main_~d3~0#1|) (or (fp.isNormal |ULTIMATE.start_main_~d4~0#1|) (fp.isSubnormal |ULTIMATE.start_main_~d4~0#1|) (fp.isZero |ULTIMATE.start_main_~d4~0#1|))) [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point L1003-1(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,890 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:20:11,891 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 990) no Hoare annotation was computed. [2022-02-20 16:20:11,892 INFO L854 garLoopResultBuilder]: At program point L987(line 987) the Hoare annotation is: (and (fp.isNormal |ULTIMATE.start_main_~d1~0#1|) (fp.isInfinite |ULTIMATE.start_main_~d2~0#1|)) [2022-02-20 16:20:11,892 INFO L858 garLoopResultBuilder]: For program point L987-1(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,892 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 981) no Hoare annotation was computed. [2022-02-20 16:20:11,892 INFO L858 garLoopResultBuilder]: For program point L975(line 975) no Hoare annotation was computed. [2022-02-20 16:20:11,892 INFO L858 garLoopResultBuilder]: For program point L975-2(line 975) no Hoare annotation was computed. [2022-02-20 16:20:11,892 INFO L858 garLoopResultBuilder]: For program point L1004(line 1004) no Hoare annotation was computed. [2022-02-20 16:20:11,892 INFO L858 garLoopResultBuilder]: For program point L967(lines 967 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,892 INFO L854 garLoopResultBuilder]: At program point L996(line 996) the Hoare annotation is: (and (fp.isNormal |ULTIMATE.start_main_~d1~0#1|) (fp.isInfinite |ULTIMATE.start_main_~d2~0#1|) (fp.isNaN |ULTIMATE.start_main_~d3~0#1|)) [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point L996-1(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 989) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point L988(line 988) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point L988-2(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1004) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 975) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L854 garLoopResultBuilder]: At program point L980(line 980) the Hoare annotation is: (fp.isNormal |ULTIMATE.start_main_~d1~0#1|) [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point L980-1(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L861 garLoopResultBuilder]: At program point L972(line 972) the Hoare annotation is: true [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point L972-1(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point L997(line 997) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point L997-2(lines 968 1005) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L858 garLoopResultBuilder]: For program point L3-2(lines 2 4) no Hoare annotation was computed. [2022-02-20 16:20:11,893 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 2 4) the Hoare annotation is: true [2022-02-20 16:20:11,894 INFO L858 garLoopResultBuilder]: For program point L3(line 3) no Hoare annotation was computed. [2022-02-20 16:20:11,894 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 2 4) no Hoare annotation was computed. [2022-02-20 16:20:11,896 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:20:11,897 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:20:11,902 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:20:11,905 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2022-02-20 16:20:11,905 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:20:11,905 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2022-02-20 16:20:11,905 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2022-02-20 16:20:11,905 WARN L170 areAnnotationChecker]: L972-1 has no Hoare annotation [2022-02-20 16:20:11,905 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2022-02-20 16:20:11,905 WARN L170 areAnnotationChecker]: L972-1 has no Hoare annotation [2022-02-20 16:20:11,905 WARN L170 areAnnotationChecker]: L972-1 has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: L973 has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: L973 has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: L973-2 has no Hoare annotation [2022-02-20 16:20:11,906 WARN L170 areAnnotationChecker]: L973-2 has no Hoare annotation [2022-02-20 16:20:11,907 WARN L170 areAnnotationChecker]: L980-1 has no Hoare annotation [2022-02-20 16:20:11,907 WARN L170 areAnnotationChecker]: L980-1 has no Hoare annotation [2022-02-20 16:20:11,907 WARN L170 areAnnotationChecker]: L987-1 has no Hoare annotation [2022-02-20 16:20:11,907 WARN L170 areAnnotationChecker]: L987-1 has no Hoare annotation [2022-02-20 16:20:11,907 WARN L170 areAnnotationChecker]: L996-1 has no Hoare annotation [2022-02-20 16:20:11,923 WARN L170 areAnnotationChecker]: L996-1 has no Hoare annotation [2022-02-20 16:20:11,923 WARN L170 areAnnotationChecker]: L1003-1 has no Hoare annotation [2022-02-20 16:20:11,923 WARN L170 areAnnotationChecker]: L1003-1 has no Hoare annotation [2022-02-20 16:20:11,923 WARN L170 areAnnotationChecker]: L974 has no Hoare annotation [2022-02-20 16:20:11,924 WARN L170 areAnnotationChecker]: L974 has no Hoare annotation [2022-02-20 16:20:11,924 WARN L170 areAnnotationChecker]: L974-2 has no Hoare annotation [2022-02-20 16:20:11,924 WARN L170 areAnnotationChecker]: L974-2 has no Hoare annotation [2022-02-20 16:20:11,924 WARN L170 areAnnotationChecker]: L981 has no Hoare annotation [2022-02-20 16:20:11,924 WARN L170 areAnnotationChecker]: L981 has no Hoare annotation [2022-02-20 16:20:11,924 WARN L170 areAnnotationChecker]: L981-2 has no Hoare annotation [2022-02-20 16:20:11,924 WARN L170 areAnnotationChecker]: L981-2 has no Hoare annotation [2022-02-20 16:20:11,924 WARN L170 areAnnotationChecker]: L988 has no Hoare annotation [2022-02-20 16:20:11,925 WARN L170 areAnnotationChecker]: L988 has no Hoare annotation [2022-02-20 16:20:11,925 WARN L170 areAnnotationChecker]: L988-2 has no Hoare annotation [2022-02-20 16:20:11,925 WARN L170 areAnnotationChecker]: L988-2 has no Hoare annotation [2022-02-20 16:20:11,925 WARN L170 areAnnotationChecker]: L997 has no Hoare annotation [2022-02-20 16:20:11,925 WARN L170 areAnnotationChecker]: L997 has no Hoare annotation [2022-02-20 16:20:11,925 WARN L170 areAnnotationChecker]: L997-2 has no Hoare annotation [2022-02-20 16:20:11,925 WARN L170 areAnnotationChecker]: L997-2 has no Hoare annotation [2022-02-20 16:20:11,925 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2022-02-20 16:20:11,927 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2022-02-20 16:20:11,927 WARN L170 areAnnotationChecker]: L967 has no Hoare annotation [2022-02-20 16:20:11,927 WARN L170 areAnnotationChecker]: L975 has no Hoare annotation [2022-02-20 16:20:11,927 WARN L170 areAnnotationChecker]: L975 has no Hoare annotation [2022-02-20 16:20:11,927 WARN L170 areAnnotationChecker]: L975-2 has no Hoare annotation [2022-02-20 16:20:11,927 WARN L170 areAnnotationChecker]: L982 has no Hoare annotation [2022-02-20 16:20:11,927 WARN L170 areAnnotationChecker]: L982 has no Hoare annotation [2022-02-20 16:20:11,927 WARN L170 areAnnotationChecker]: L982-2 has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: L989 has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: L989 has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: L989-2 has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: L989-2 has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: L998 has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: L998-2 has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:20:11,928 WARN L170 areAnnotationChecker]: L980-1 has no Hoare annotation [2022-02-20 16:20:11,929 WARN L170 areAnnotationChecker]: L987-1 has no Hoare annotation [2022-02-20 16:20:11,929 WARN L170 areAnnotationChecker]: L990 has no Hoare annotation [2022-02-20 16:20:11,929 WARN L170 areAnnotationChecker]: L990 has no Hoare annotation [2022-02-20 16:20:11,929 WARN L170 areAnnotationChecker]: L990-2 has no Hoare annotation [2022-02-20 16:20:11,929 WARN L170 areAnnotationChecker]: L1003-1 has no Hoare annotation [2022-02-20 16:20:11,929 WARN L170 areAnnotationChecker]: L996-1 has no Hoare annotation [2022-02-20 16:20:11,929 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:20:11,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:20:11 BoogieIcfgContainer [2022-02-20 16:20:11,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:20:11,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:20:11,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:20:11,932 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:20:11,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:06" (3/4) ... [2022-02-20 16:20:11,935 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:20:11,940 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 16:20:11,947 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 16:20:11,947 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:20:11,948 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:20:11,948 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:20:11,989 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:20:11,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:20:11,990 INFO L158 Benchmark]: Toolchain (without parser) took 6275.63ms. Allocated memory was 65.0MB in the beginning and 157.3MB in the end (delta: 92.3MB). Free memory was 45.5MB in the beginning and 52.7MB in the end (delta: -7.2MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2022-02-20 16:20:11,990 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:20:11,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.07ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 45.4MB in the beginning and 49.9MB in the end (delta: -4.5MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2022-02-20 16:20:11,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.85ms. Allocated memory is still 88.1MB. Free memory was 49.9MB in the beginning and 47.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:20:11,991 INFO L158 Benchmark]: Boogie Preprocessor took 17.36ms. Allocated memory is still 88.1MB. Free memory was 47.0MB in the beginning and 45.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:20:11,991 INFO L158 Benchmark]: RCFGBuilder took 292.51ms. Allocated memory is still 88.1MB. Free memory was 45.4MB in the beginning and 60.6MB in the end (delta: -15.2MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-02-20 16:20:11,991 INFO L158 Benchmark]: TraceAbstraction took 5244.38ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 59.9MB in the beginning and 55.9MB in the end (delta: 4.0MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2022-02-20 16:20:11,991 INFO L158 Benchmark]: Witness Printer took 57.61ms. Allocated memory is still 157.3MB. Free memory was 55.9MB in the beginning and 52.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:20:11,992 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.07ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 45.4MB in the beginning and 49.9MB in the end (delta: -4.5MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.85ms. Allocated memory is still 88.1MB. Free memory was 49.9MB in the beginning and 47.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.36ms. Allocated memory is still 88.1MB. Free memory was 47.0MB in the beginning and 45.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 292.51ms. Allocated memory is still 88.1MB. Free memory was 45.4MB in the beginning and 60.6MB in the end (delta: -15.2MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5244.38ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 59.9MB in the beginning and 55.9MB in the end (delta: 4.0MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. * Witness Printer took 57.61ms. Allocated memory is still 157.3MB. Free memory was 55.9MB in the beginning and 52.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 973]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 974]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 975]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 981]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 982]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 988]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 989]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 990]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 997]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 998]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1004]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 90 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 195 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 6 LocationsWithAnnotation, 14 PreInvPairs, 18 NumberOfFragments, 30 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 8 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 80/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 16:20:12,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE