./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0874.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0874.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 961c2aeb6a53bc095902951ff31f208c55ff3f20 ............................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0874.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 961c2aeb6a53bc095902951ff31f208c55ff3f20 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 06:45:41,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:45:41,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:45:41,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:45:41,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:45:41,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:45:41,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:45:41,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:45:41,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:45:42,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:45:42,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:45:42,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:45:42,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:45:42,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:45:42,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:45:42,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:45:42,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:45:42,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:45:42,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:45:42,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:45:42,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:45:42,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:45:42,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:45:42,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:45:42,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:45:42,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:45:42,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:45:42,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:45:42,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:45:42,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:45:42,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:45:42,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:45:42,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:45:42,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:45:42,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:45:42,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:45:42,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:45:42,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:45:42,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:45:42,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:45:42,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:45:42,045 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 06:45:42,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:45:42,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:45:42,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:45:42,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:45:42,087 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:45:42,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:45:42,088 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:45:42,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 06:45:42,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:45:42,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:45:42,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:45:42,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:45:42,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:45:42,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:45:42,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:45:42,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:45:42,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:45:42,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:45:42,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:45:42,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:45:42,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:45:42,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:45:42,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:45:42,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:45:42,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:45:42,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 06:45:42,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 06:45:42,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:45:42,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 961c2aeb6a53bc095902951ff31f208c55ff3f20 [2019-11-20 06:45:42,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:45:42,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:45:42,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:45:42,274 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:45:42,274 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:45:42,275 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0874.c [2019-11-20 06:45:42,341 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data/b1de5b1af/e9c82f1e1cf045c08fea638fd1147e41/FLAG216f4a3b1 [2019-11-20 06:45:42,820 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:45:42,821 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/sv-benchmarks/c/float-newlib/double_req_bl_0874.c [2019-11-20 06:45:42,835 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data/b1de5b1af/e9c82f1e1cf045c08fea638fd1147e41/FLAG216f4a3b1 [2019-11-20 06:45:43,089 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data/b1de5b1af/e9c82f1e1cf045c08fea638fd1147e41 [2019-11-20 06:45:43,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:45:43,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:45:43,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:43,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:45:43,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:45:43,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:43" (1/1) ... [2019-11-20 06:45:43,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1d0946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:43, skipping insertion in model container [2019-11-20 06:45:43,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:43" (1/1) ... [2019-11-20 06:45:43,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:45:43,155 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:45:43,470 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:835) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:1636) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$41(StandardFunctionHandler.java:317) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:210) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1262) 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.FunctionHandler.handleReturnStatement(FunctionHandler.java:540) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1832) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1455) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:906) 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.visit(CHandler.java:1432) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:906) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1284) 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:3361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2176) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:540) 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:187) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:114) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 06:45:43,477 INFO L168 Benchmark]: Toolchain (without parser) took 383.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-20 06:45:43,478 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:45:43,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-20 06:45:43,481 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:835) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 06:45:45,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 06:45:45,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 06:45:45,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 06:45:45,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 06:45:45,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 06:45:45,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 06:45:45,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 06:45:45,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 06:45:45,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 06:45:45,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 06:45:45,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 06:45:45,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 06:45:45,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 06:45:45,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 06:45:45,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 06:45:45,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 06:45:45,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 06:45:45,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 06:45:45,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 06:45:45,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 06:45:45,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 06:45:45,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 06:45:45,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 06:45:45,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 06:45:45,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 06:45:45,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 06:45:45,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 06:45:45,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 06:45:45,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 06:45:45,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 06:45:45,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 06:45:45,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 06:45:45,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 06:45:45,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 06:45:45,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 06:45:45,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 06:45:45,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 06:45:45,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 06:45:45,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 06:45:45,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 06:45:45,579 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 06:45:45,594 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 06:45:45,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 06:45:45,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 06:45:45,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 06:45:45,597 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 06:45:45,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 06:45:45,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 06:45:45,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 06:45:45,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 06:45:45,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 06:45:45,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 06:45:45,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 06:45:45,599 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 06:45:45,599 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 06:45:45,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 06:45:45,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 06:45:45,600 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 06:45:45,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 06:45:45,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 06:45:45,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 06:45:45,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 06:45:45,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 06:45:45,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:45:45,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 06:45:45,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 06:45:45,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 06:45:45,603 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 06:45:45,604 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 06:45:45,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 06:45:45,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 06:45:45,605 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 961c2aeb6a53bc095902951ff31f208c55ff3f20 [2019-11-20 06:45:45,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 06:45:46,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 06:45:46,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 06:45:46,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 06:45:46,011 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 06:45:46,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0874.c [2019-11-20 06:45:46,084 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data/12a6c529b/600944ead5f742b393a6a9b3e86967b9/FLAG18991f415 [2019-11-20 06:45:46,611 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 06:45:46,615 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/sv-benchmarks/c/float-newlib/double_req_bl_0874.c [2019-11-20 06:45:46,626 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data/12a6c529b/600944ead5f742b393a6a9b3e86967b9/FLAG18991f415 [2019-11-20 06:45:46,906 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/data/12a6c529b/600944ead5f742b393a6a9b3e86967b9 [2019-11-20 06:45:46,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 06:45:46,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 06:45:46,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:46,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 06:45:46,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 06:45:46,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:46" (1/1) ... [2019-11-20 06:45:46,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7c1757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:46, skipping insertion in model container [2019-11-20 06:45:46,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:45:46" (1/1) ... [2019-11-20 06:45:46,932 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 06:45:46,980 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 06:45:47,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:45:47,281 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 06:45:47,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 06:45:47,485 INFO L192 MainTranslator]: Completed translation [2019-11-20 06:45:47,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47 WrapperNode [2019-11-20 06:45:47,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 06:45:47,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 06:45:47,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 06:45:47,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 06:45:47,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 06:45:47,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 06:45:47,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 06:45:47,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 06:45:47,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... [2019-11-20 06:45:47,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 06:45:47,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 06:45:47,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 06:45:47,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 06:45:47,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 06:45:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 06:45:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 06:45:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 06:45:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 06:45:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 06:45:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 06:45:47,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 06:45:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 06:45:47,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 06:46:34,776 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 06:46:34,777 INFO L285 CfgBuilder]: Removed 98 assume(true) statements. [2019-11-20 06:46:34,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:46:34 BoogieIcfgContainer [2019-11-20 06:46:34,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 06:46:34,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 06:46:34,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 06:46:34,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 06:46:34,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:45:46" (1/3) ... [2019-11-20 06:46:34,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d09bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:46:34, skipping insertion in model container [2019-11-20 06:46:34,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:45:47" (2/3) ... [2019-11-20 06:46:34,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d09bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:46:34, skipping insertion in model container [2019-11-20 06:46:34,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:46:34" (3/3) ... [2019-11-20 06:46:34,788 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0874.c [2019-11-20 06:46:34,797 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 06:46:34,804 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 06:46:34,814 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 06:46:34,840 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 06:46:34,841 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 06:46:34,841 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 06:46:34,841 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 06:46:34,841 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 06:46:34,842 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 06:46:34,842 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 06:46:34,842 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 06:46:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2019-11-20 06:46:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 06:46:34,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:34,872 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:34,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash -264009365, now seen corresponding path program 1 times [2019-11-20 06:46:34,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:46:34,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427836808] [2019-11-20 06:46:34,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 06:46:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:35,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 06:46:35,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:35,156 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:46:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:35,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427836808] [2019-11-20 06:46:35,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:35,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 06:46:35,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085678111] [2019-11-20 06:46:35,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 06:46:35,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:46:35,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 06:46:35,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 06:46:35,185 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 2 states. [2019-11-20 06:46:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:35,227 INFO L93 Difference]: Finished difference Result 442 states and 754 transitions. [2019-11-20 06:46:35,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 06:46:35,229 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-11-20 06:46:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:35,242 INFO L225 Difference]: With dead ends: 442 [2019-11-20 06:46:35,243 INFO L226 Difference]: Without dead ends: 218 [2019-11-20 06:46:35,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 06:46:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-20 06:46:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-11-20 06:46:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-20 06:46:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 296 transitions. [2019-11-20 06:46:35,300 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 296 transitions. Word has length 17 [2019-11-20 06:46:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:35,301 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 296 transitions. [2019-11-20 06:46:35,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 06:46:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 296 transitions. [2019-11-20 06:46:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 06:46:35,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:35,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:35,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 06:46:35,518 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:35,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1586530375, now seen corresponding path program 1 times [2019-11-20 06:46:35,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:46:35,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062470100] [2019-11-20 06:46:35,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 06:46:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:35,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 06:46:35,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:36,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:46:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:36,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062470100] [2019-11-20 06:46:36,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:36,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 06:46:36,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707764511] [2019-11-20 06:46:36,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 06:46:36,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:46:36,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 06:46:36,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 06:46:36,260 INFO L87 Difference]: Start difference. First operand 218 states and 296 transitions. Second operand 10 states. [2019-11-20 06:46:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:46:43,952 INFO L93 Difference]: Finished difference Result 351 states and 468 transitions. [2019-11-20 06:46:44,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 06:46:44,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-20 06:46:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:46:44,096 INFO L225 Difference]: With dead ends: 351 [2019-11-20 06:46:44,096 INFO L226 Difference]: Without dead ends: 152 [2019-11-20 06:46:44,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-20 06:46:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-20 06:46:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2019-11-20 06:46:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-20 06:46:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2019-11-20 06:46:44,115 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 22 [2019-11-20 06:46:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:46:44,128 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2019-11-20 06:46:44,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 06:46:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2019-11-20 06:46:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:46:44,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:46:44,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:46:44,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 06:46:44,349 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:46:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:46:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash 199776244, now seen corresponding path program 1 times [2019-11-20 06:46:44,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:46:44,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850426515] [2019-11-20 06:46:44,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 06:46:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:46:44,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 06:46:44,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:46:44,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 06:46:44,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 06:46:44,768 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:44,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:44,775 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:44,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:44,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:44,787 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2019-11-20 06:46:48,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:48,410 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:46:57,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2019-11-20 06:46:57,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 06:46:57,203 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:57,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:57,215 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:57,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:46:57,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 06:46:57,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:46 [2019-11-20 06:46:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:46:57,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850426515] [2019-11-20 06:46:57,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:46:57,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2019-11-20 06:46:57,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707934231] [2019-11-20 06:46:57,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 06:46:57,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:46:57,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 06:46:57,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-11-20 06:46:57,781 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand 18 states. [2019-11-20 06:46:58,334 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 06:47:04,130 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 06:47:06,368 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 06:47:06,866 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 06:47:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:11,828 INFO L93 Difference]: Finished difference Result 169 states and 199 transitions. [2019-11-20 06:47:11,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 06:47:11,830 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-20 06:47:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:11,831 INFO L225 Difference]: With dead ends: 169 [2019-11-20 06:47:11,831 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 06:47:11,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-11-20 06:47:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 06:47:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2019-11-20 06:47:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 06:47:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-20 06:47:11,839 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2019-11-20 06:47:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:11,840 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-20 06:47:11,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 06:47:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-20 06:47:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 06:47:11,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:47:11,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:47:12,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 06:47:12,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:47:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:47:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash -609570382, now seen corresponding path program 1 times [2019-11-20 06:47:12,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:47:12,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729329285] [2019-11-20 06:47:12,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 06:47:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:12,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 06:47:12,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:47:12,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 06:47:12,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 06:47:12,578 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:12,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:12,586 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:12,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:12,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:12,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:43 [2019-11-20 06:47:13,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-20 06:47:13,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:47:13,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-20 06:47:13,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:13,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:13,668 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:13,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 06:47:13,669 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:13,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:13,674 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:47:13,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:13,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:13,716 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:97, output treesize:69 [2019-11-20 06:47:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:47:14,017 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:47:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 06:47:14,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-20 06:47:14,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 06:47:14,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,292 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 47 [2019-11-20 06:47:14,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 33 [2019-11-20 06:47:14,377 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-11-20 06:47:14,421 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,433 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 60 [2019-11-20 06:47:14,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 37 [2019-11-20 06:47:14,501 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-11-20 06:47:14,534 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,545 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-20 06:47:14,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 06:47:14,573 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,583 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:47:14,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:14,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-11-20 06:47:14,629 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:188, output treesize:77 [2019-11-20 06:47:14,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 06:47:15,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2019-11-20 06:47:15,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 06:47:15,431 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:15,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:15,463 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:15,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:15,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2019-11-20 06:47:15,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 06:47:15,561 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:15,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:15,584 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:15,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:15,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-20 06:47:15,665 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:147, output treesize:93 [2019-11-20 06:47:15,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 06:47:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:47:16,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729329285] [2019-11-20 06:47:16,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:47:16,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-20 06:47:16,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309526453] [2019-11-20 06:47:16,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 06:47:16,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:47:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 06:47:16,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-11-20 06:47:16,324 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 20 states. [2019-11-20 06:47:21,024 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-11-20 06:47:23,701 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-11-20 06:47:24,662 WARN L191 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-11-20 06:47:26,461 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2019-11-20 06:47:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:26,751 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-20 06:47:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 06:47:26,754 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2019-11-20 06:47:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:26,755 INFO L225 Difference]: With dead ends: 61 [2019-11-20 06:47:26,755 INFO L226 Difference]: Without dead ends: 32 [2019-11-20 06:47:26,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-11-20 06:47:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-20 06:47:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-20 06:47:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 06:47:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-11-20 06:47:26,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 24 [2019-11-20 06:47:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:26,762 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-11-20 06:47:26,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 06:47:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-11-20 06:47:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 06:47:26,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 06:47:26,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 06:47:26,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 06:47:26,964 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 06:47:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 06:47:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1865467459, now seen corresponding path program 1 times [2019-11-20 06:47:26,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 06:47:26,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806465180] [2019-11-20 06:47:26,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2cba72f4-413d-48ae-a1f0-ddf6f1ecf608/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 06:47:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 06:47:27,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 06:47:27,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 06:47:27,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-11-20 06:47:27,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 06:47:27,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2019-11-20 06:47:27,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:27,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:27,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-20 06:47:27,491 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:27,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:27,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:27,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2019-11-20 06:47:27,525 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:27,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:27,538 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:47:27,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:27,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:27,560 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:35 [2019-11-20 06:47:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:47:27,799 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 06:47:27,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:27,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 103 treesize of output 103 [2019-11-20 06:47:27,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:27,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 87 treesize of output 100 [2019-11-20 06:47:27,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:28,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:28,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 59 [2019-11-20 06:47:28,042 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:28,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:28,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:28,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2019-11-20 06:47:28,096 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 06:47:28,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:28,114 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 06:47:28,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 06:47:28,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 06:47:28,134 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:65 [2019-11-20 06:47:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 06:47:29,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806465180] [2019-11-20 06:47:29,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 06:47:29,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2019-11-20 06:47:29,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359132582] [2019-11-20 06:47:29,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 06:47:29,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 06:47:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 06:47:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-20 06:47:29,470 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 18 states. [2019-11-20 06:47:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 06:47:30,355 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-11-20 06:47:30,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 06:47:30,356 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-20 06:47:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 06:47:30,356 INFO L225 Difference]: With dead ends: 32 [2019-11-20 06:47:30,356 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 06:47:30,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2019-11-20 06:47:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 06:47:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 06:47:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 06:47:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 06:47:30,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-11-20 06:47:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 06:47:30,358 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 06:47:30,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 06:47:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 06:47:30,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 06:47:30,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 06:47:30,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 06:47:31,045 WARN L191 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2019-11-20 06:47:33,401 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 129 [2019-11-20 06:47:35,747 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-20 06:47:38,234 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification that was a NOOP. DAG size: 95 [2019-11-20 06:47:38,264 INFO L440 ceAbstractionStarter]: At program point L35-2(lines 17 36) the Hoare annotation is: false [2019-11-20 06:47:38,264 INFO L444 ceAbstractionStarter]: For program point L498(lines 498 499) no Hoare annotation was computed. [2019-11-20 06:47:38,264 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 565 570) no Hoare annotation was computed. [2019-11-20 06:47:38,264 INFO L440 ceAbstractionStarter]: At program point L565-2(lines 565 570) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse6 (fp.div roundNearestTiesToEven (fp.neg .cse1) (_ +zero 11 53)))) (let ((.cse2 (fp.neg .cse6))) (and (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (fp.lt (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start___ieee754_pow_~hx~2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)))) (or (not (fp.lt |ULTIMATE.start_main_#t~ret88| .cse1)) (forall ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64))) (or (not (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (_ bv2148532224 32)) (_ bv0 32))) (not (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|))))))) (= ULTIMATE.start_isinf_double_~x .cse2) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_9_4))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (fp.lt (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (= ULTIMATE.start___ieee754_pow_~y .cse6) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (fp.lt (let ((.cse7 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (= .cse6 ULTIMATE.start_main_~y~0) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~hy~1) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0))) (= .cse2 |ULTIMATE.start___ieee754_pow_#res|))))) [2019-11-20 06:47:38,264 INFO L444 ceAbstractionStarter]: For program point L565-3(lines 565 570) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 302) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L501(lines 501 508) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L501-2(lines 494 508) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 307) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 507) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 306) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L372-1(lines 372 377) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L440 ceAbstractionStarter]: At program point L372-2(lines 372 377) the Hoare annotation is: false [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L372-3(lines 372 377) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L505(lines 505 506) no Hoare annotation was computed. [2019-11-20 06:47:38,265 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 190) no Hoare annotation was computed. [2019-11-20 06:47:38,266 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 44 49) no Hoare annotation was computed. [2019-11-20 06:47:38,266 INFO L440 ceAbstractionStarter]: At program point L44-2(lines 44 49) the Hoare annotation is: false [2019-11-20 06:47:38,266 INFO L444 ceAbstractionStarter]: For program point L44-3(lines 44 49) no Hoare annotation was computed. [2019-11-20 06:47:38,266 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 441 446) no Hoare annotation was computed. [2019-11-20 06:47:38,266 INFO L440 ceAbstractionStarter]: At program point L441-2(lines 441 446) the Hoare annotation is: false [2019-11-20 06:47:38,266 INFO L444 ceAbstractionStarter]: For program point L441-3(lines 441 446) no Hoare annotation was computed. [2019-11-20 06:47:38,267 INFO L440 ceAbstractionStarter]: At program point L574(lines 563 575) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse9 (fp.div roundNearestTiesToEven (fp.neg .cse1) (_ +zero 11 53)))) (let ((.cse2 (fp.neg .cse9))) (and (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (fp.lt (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start___ieee754_pow_~hx~2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)))) (or (not (fp.lt |ULTIMATE.start_main_#t~ret88| .cse1)) (forall ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64))) (or (not (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (_ bv2148532224 32)) (_ bv0 32))) (not (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|))))))) (= ULTIMATE.start_isinf_double_~x .cse2) (exists ((|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64)) (v_skolemized_v_prenex_26_3 (_ BitVec 64))) (let ((.cse4 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|)) (.cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_78|))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_26_3) ((_ extract 62 52) v_skolemized_v_prenex_26_3) ((_ extract 51 0) v_skolemized_v_prenex_26_3)) (fp.neg (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (= (bvadd |ULTIMATE.start_isinf_double_#res| (_ bv4294967295 32)) (bvneg (bvlshr (let ((.cse3 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) .cse4) (bvlshr (bvor .cse5 (bvneg .cse5)) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse3 (bvneg .cse3))) (_ bv31 32)))) (= ((_ extract 63 32) v_skolemized_v_prenex_26_3) .cse4) (= ((_ extract 31 0) v_skolemized_v_prenex_26_3) .cse5)))) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_9_4))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse7 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (fp.lt (let ((.cse8 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (= ULTIMATE.start___ieee754_pow_~y .cse9) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (fp.lt (let ((.cse10 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (= .cse9 ULTIMATE.start_main_~y~0) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~hy~1) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0))) (= .cse2 |ULTIMATE.start___ieee754_pow_#res|))))) [2019-11-20 06:47:38,267 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-11-20 06:47:38,267 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 117) no Hoare annotation was computed. [2019-11-20 06:47:38,267 INFO L444 ceAbstractionStarter]: For program point L112-2(lines 112 117) no Hoare annotation was computed. [2019-11-20 06:47:38,267 INFO L444 ceAbstractionStarter]: For program point L311(lines 311 332) no Hoare annotation was computed. [2019-11-20 06:47:38,267 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 116) no Hoare annotation was computed. [2019-11-20 06:47:38,267 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2019-11-20 06:47:38,267 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 188) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 318) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 116) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 527) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L513-2(lines 513 527) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 318) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 188) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 63) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L51-2(lines 42 92) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L316(line 316) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L316-2(line 316) no Hoare annotation was computed. [2019-11-20 06:47:38,268 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 185) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L184-2(lines 184 185) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 391) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L383-1(lines 383 391) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L318-2(line 318) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 131) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L120-2(lines 120 131) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 517 522) no Hoare annotation was computed. [2019-11-20 06:47:38,269 INFO L440 ceAbstractionStarter]: At program point L517-2(lines 517 522) the Hoare annotation is: false [2019-11-20 06:47:38,269 INFO L444 ceAbstractionStarter]: For program point L517-3(lines 517 522) no Hoare annotation was computed. [2019-11-20 06:47:38,270 INFO L440 ceAbstractionStarter]: At program point L121-2(lines 121 125) the Hoare annotation is: false [2019-11-20 06:47:38,270 INFO L444 ceAbstractionStarter]: For program point L121-3(lines 121 125) no Hoare annotation was computed. [2019-11-20 06:47:38,270 INFO L444 ceAbstractionStarter]: For program point L55-1(lines 55 59) no Hoare annotation was computed. [2019-11-20 06:47:38,270 INFO L440 ceAbstractionStarter]: At program point L55-2(lines 55 59) the Hoare annotation is: false [2019-11-20 06:47:38,270 INFO L444 ceAbstractionStarter]: For program point L55-3(lines 55 59) no Hoare annotation was computed. [2019-11-20 06:47:38,270 INFO L444 ceAbstractionStarter]: For program point L386-1(lines 386 390) no Hoare annotation was computed. [2019-11-20 06:47:38,270 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 325) no Hoare annotation was computed. [2019-11-20 06:47:38,270 INFO L440 ceAbstractionStarter]: At program point L386-2(lines 386 390) the Hoare annotation is: false [2019-11-20 06:47:38,270 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 453 458) no Hoare annotation was computed. [2019-11-20 06:47:38,270 INFO L440 ceAbstractionStarter]: At program point L453-2(lines 453 458) the Hoare annotation is: false [2019-11-20 06:47:38,270 INFO L444 ceAbstractionStarter]: For program point L453-3(lines 453 458) no Hoare annotation was computed. [2019-11-20 06:47:38,270 INFO L444 ceAbstractionStarter]: For program point L321(lines 321 324) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L588(lines 588 598) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L588-2(lines 588 598) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L126-2(lines 126 127) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L440 ceAbstractionStarter]: At program point L126-3(lines 126 127) the Hoare annotation is: false [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L126-4(lines 126 127) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L193(lines 193 194) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L193-2(lines 193 194) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 525) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L524-2(lines 524 525) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 327) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 331) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L196-1(lines 196 201) no Hoare annotation was computed. [2019-11-20 06:47:38,271 INFO L440 ceAbstractionStarter]: At program point L196-2(lines 196 201) the Hoare annotation is: false [2019-11-20 06:47:38,271 INFO L444 ceAbstractionStarter]: For program point L196-3(lines 196 201) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 330) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 595) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 597) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 404) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 529 534) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L440 ceAbstractionStarter]: At program point L529-2(lines 529 534) the Hoare annotation is: false [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L529-3(lines 529 534) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 68) no Hoare annotation was computed. [2019-11-20 06:47:38,272 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2019-11-20 06:47:38,273 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 137) no Hoare annotation was computed. [2019-11-20 06:47:38,273 INFO L444 ceAbstractionStarter]: For program point L134-2(lines 134 137) no Hoare annotation was computed. [2019-11-20 06:47:38,273 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 465 470) no Hoare annotation was computed. [2019-11-20 06:47:38,273 INFO L440 ceAbstractionStarter]: At program point L465-2(lines 465 470) the Hoare annotation is: false [2019-11-20 06:47:38,273 INFO L444 ceAbstractionStarter]: For program point L465-3(lines 465 470) no Hoare annotation was computed. [2019-11-20 06:47:38,273 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 77) no Hoare annotation was computed. [2019-11-20 06:47:38,273 INFO L444 ceAbstractionStarter]: For program point L268-1(lines 268 273) no Hoare annotation was computed. [2019-11-20 06:47:38,274 INFO L440 ceAbstractionStarter]: At program point L268-2(lines 268 273) the Hoare annotation is: (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (not (fp.lt |ULTIMATE.start_main_#t~ret88| .cse5))) (.cse2 (fp.div roundNearestTiesToEven (fp.neg .cse5) (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (fp.lt (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (= ULTIMATE.start___ieee754_pow_~y .cse2) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64))) (or (not (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (_ bv2148532224 32)) (_ bv0 32))) (not (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|))))))) (or (forall ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64)) (ULTIMATE.start___ieee754_pow_~lx~1 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)) ULTIMATE.start_main_~x~0)) (not (= (bvor (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|)) (_ bv3222274048 32)) ULTIMATE.start___ieee754_pow_~lx~1) (_ bv0 32))))) .cse3) (= .cse2 ULTIMATE.start_main_~y~0) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|) ULTIMATE.start_fabs_double_~high~0) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|))))) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|))) (= (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|)) v_arrayElimCell_2))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_fabs_double_#res|)))))) [2019-11-20 06:47:38,274 INFO L440 ceAbstractionStarter]: At program point L202(lines 95 203) the Hoare annotation is: false [2019-11-20 06:47:38,274 INFO L444 ceAbstractionStarter]: For program point L70-1(lines 70 75) no Hoare annotation was computed. [2019-11-20 06:47:38,274 INFO L440 ceAbstractionStarter]: At program point L70-2(lines 70 75) the Hoare annotation is: false [2019-11-20 06:47:38,274 INFO L444 ceAbstractionStarter]: For program point L70-3(lines 70 75) no Hoare annotation was computed. [2019-11-20 06:47:38,274 INFO L447 ceAbstractionStarter]: At program point L600(lines 577 601) the Hoare annotation is: true [2019-11-20 06:47:38,274 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 349) no Hoare annotation was computed. [2019-11-20 06:47:38,274 INFO L444 ceAbstractionStarter]: For program point L336-2(lines 261 560) no Hoare annotation was computed. [2019-11-20 06:47:38,274 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 348) no Hoare annotation was computed. [2019-11-20 06:47:38,274 INFO L444 ceAbstractionStarter]: For program point L206-1(lines 206 210) no Hoare annotation was computed. [2019-11-20 06:47:38,274 INFO L440 ceAbstractionStarter]: At program point L206-2(lines 206 210) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fabs_double_~x ULTIMATE.start_main_~x~0)) [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L206-5(lines 206 210) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L440 ceAbstractionStarter]: At program point L206-6(lines 206 210) the Hoare annotation is: false [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 410) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L405-1(lines 379 472) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 340) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L405-2(lines 405 410) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L339-2(lines 337 348) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L274(lines 274 279) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L274-1(lines 261 560) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L274-2(lines 274 279) no Hoare annotation was computed. [2019-11-20 06:47:38,275 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 345) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 83) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L475(lines 475 476) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L475-2(lines 475 476) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 216) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L211-1(lines 204 218) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L211-2(lines 211 216) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L211-3(lines 211 216) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L440 ceAbstractionStarter]: At program point L145-2(lines 145 155) the Hoare annotation is: false [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L211-4(lines 204 218) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L79(lines 79 82) no Hoare annotation was computed. [2019-11-20 06:47:38,276 INFO L444 ceAbstractionStarter]: For program point L145-3(lines 145 155) no Hoare annotation was computed. [2019-11-20 06:47:38,277 INFO L444 ceAbstractionStarter]: For program point L211-5(lines 211 216) no Hoare annotation was computed. [2019-11-20 06:47:38,277 INFO L444 ceAbstractionStarter]: For program point L344(lines 344 345) no Hoare annotation was computed. [2019-11-20 06:47:38,277 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 151) no Hoare annotation was computed. [2019-11-20 06:47:38,277 INFO L444 ceAbstractionStarter]: For program point L147-2(lines 147 151) no Hoare annotation was computed. [2019-11-20 06:47:38,277 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 544 548) no Hoare annotation was computed. [2019-11-20 06:47:38,277 INFO L440 ceAbstractionStarter]: At program point L544-2(lines 544 548) the Hoare annotation is: false [2019-11-20 06:47:38,279 INFO L444 ceAbstractionStarter]: For program point L544-3(lines 544 548) no Hoare annotation was computed. [2019-11-20 06:47:38,279 INFO L444 ceAbstractionStarter]: For program point L479-1(lines 479 484) no Hoare annotation was computed. [2019-11-20 06:47:38,279 INFO L440 ceAbstractionStarter]: At program point L479-2(lines 479 484) the Hoare annotation is: false [2019-11-20 06:47:38,280 INFO L444 ceAbstractionStarter]: For program point L479-3(lines 479 484) no Hoare annotation was computed. [2019-11-20 06:47:38,280 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 284) no Hoare annotation was computed. [2019-11-20 06:47:38,280 INFO L440 ceAbstractionStarter]: At program point L217(lines 204 218) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~y~0) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|) ULTIMATE.start_fabs_double_~high~0) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|))))) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|))) (= (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|)) v_arrayElimCell_2))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_fabs_double_#res|)))) [2019-11-20 06:47:38,280 INFO L440 ceAbstractionStarter]: At program point L217-1(lines 204 218) the Hoare annotation is: false [2019-11-20 06:47:38,280 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 85 90) no Hoare annotation was computed. [2019-11-20 06:47:38,280 INFO L440 ceAbstractionStarter]: At program point L85-2(lines 85 90) the Hoare annotation is: false [2019-11-20 06:47:38,280 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 06:47:38,280 INFO L444 ceAbstractionStarter]: For program point L85-3(lines 85 90) no Hoare annotation was computed. [2019-11-20 06:47:38,280 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 06:47:38,280 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 06:47:38,280 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-20 06:47:38,280 INFO L444 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L440 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L416-1(lines 416 421) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L440 ceAbstractionStarter]: At program point L416-2(lines 416 421) the Hoare annotation is: false [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L416-3(lines 416 421) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L550(lines 550 558) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 472) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L288(lines 288 291) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L354-2(lines 354 472) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 28) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 36) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 28) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 17 36) no Hoare annotation was computed. [2019-11-20 06:47:38,281 INFO L444 ceAbstractionStarter]: For program point L24-6(lines 24 28) no Hoare annotation was computed. [2019-11-20 06:47:38,282 INFO L444 ceAbstractionStarter]: For program point L24-7(lines 17 36) no Hoare annotation was computed. [2019-11-20 06:47:38,282 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 553 558) no Hoare annotation was computed. [2019-11-20 06:47:38,282 INFO L440 ceAbstractionStarter]: At program point L553-2(lines 553 558) the Hoare annotation is: false [2019-11-20 06:47:38,282 INFO L444 ceAbstractionStarter]: For program point L553-3(lines 550 558) no Hoare annotation was computed. [2019-11-20 06:47:38,282 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-11-20 06:47:38,282 INFO L444 ceAbstractionStarter]: For program point L355-2(lines 354 379) no Hoare annotation was computed. [2019-11-20 06:47:38,282 INFO L440 ceAbstractionStarter]: At program point L91(lines 42 92) the Hoare annotation is: false [2019-11-20 06:47:38,282 INFO L444 ceAbstractionStarter]: For program point L488-1(lines 488 493) no Hoare annotation was computed. [2019-11-20 06:47:38,282 INFO L440 ceAbstractionStarter]: At program point L488-2(lines 488 493) the Hoare annotation is: false [2019-11-20 06:47:38,283 INFO L444 ceAbstractionStarter]: For program point L488-3(lines 261 560) no Hoare annotation was computed. [2019-11-20 06:47:38,283 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 357) no Hoare annotation was computed. [2019-11-20 06:47:38,283 INFO L440 ceAbstractionStarter]: At program point L158-2(lines 158 174) the Hoare annotation is: false [2019-11-20 06:47:38,283 INFO L444 ceAbstractionStarter]: For program point L158-3(lines 95 203) no Hoare annotation was computed. [2019-11-20 06:47:38,283 INFO L444 ceAbstractionStarter]: For program point L357(line 357) no Hoare annotation was computed. [2019-11-20 06:47:38,283 INFO L444 ceAbstractionStarter]: For program point L357-2(line 357) no Hoare annotation was computed. [2019-11-20 06:47:38,283 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 424 429) no Hoare annotation was computed. [2019-11-20 06:47:38,284 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 359) no Hoare annotation was computed. [2019-11-20 06:47:38,284 INFO L440 ceAbstractionStarter]: At program point L424-2(lines 424 429) the Hoare annotation is: false [2019-11-20 06:47:38,284 INFO L444 ceAbstractionStarter]: For program point L424-3(lines 424 429) no Hoare annotation was computed. [2019-11-20 06:47:38,284 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 06:47:38,284 INFO L444 ceAbstractionStarter]: For program point L359(line 359) no Hoare annotation was computed. [2019-11-20 06:47:38,284 INFO L444 ceAbstractionStarter]: For program point L359-2(line 359) no Hoare annotation was computed. [2019-11-20 06:47:38,284 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 170) no Hoare annotation was computed. [2019-11-20 06:47:38,285 INFO L444 ceAbstractionStarter]: For program point L161-2(lines 161 170) no Hoare annotation was computed. [2019-11-20 06:47:38,285 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 34) no Hoare annotation was computed. [2019-11-20 06:47:38,285 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 17 36) no Hoare annotation was computed. [2019-11-20 06:47:38,285 INFO L444 ceAbstractionStarter]: For program point L29-2(lines 29 34) no Hoare annotation was computed. [2019-11-20 06:47:38,285 INFO L444 ceAbstractionStarter]: For program point L29-3(lines 29 34) no Hoare annotation was computed. [2019-11-20 06:47:38,285 INFO L444 ceAbstractionStarter]: For program point L29-4(lines 17 36) no Hoare annotation was computed. [2019-11-20 06:47:38,285 INFO L444 ceAbstractionStarter]: For program point L29-5(lines 29 34) no Hoare annotation was computed. [2019-11-20 06:47:38,286 INFO L444 ceAbstractionStarter]: For program point L29-6(lines 29 34) no Hoare annotation was computed. [2019-11-20 06:47:38,286 INFO L444 ceAbstractionStarter]: For program point L29-7(lines 17 36) no Hoare annotation was computed. [2019-11-20 06:47:38,286 INFO L444 ceAbstractionStarter]: For program point L29-8(lines 29 34) no Hoare annotation was computed. [2019-11-20 06:47:38,286 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 309) no Hoare annotation was computed. [2019-11-20 06:47:38,286 INFO L444 ceAbstractionStarter]: For program point L294-1(lines 261 560) no Hoare annotation was computed. [2019-11-20 06:47:38,287 INFO L440 ceAbstractionStarter]: At program point L559(lines 261 560) the Hoare annotation is: (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.neg .cse4) (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (fp.lt (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (fp.lt (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start___ieee754_pow_~hx~2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)))) (= ULTIMATE.start___ieee754_pow_~y .cse3) (or (not (fp.lt |ULTIMATE.start_main_#t~ret88| .cse4)) (forall ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64))) (or (not (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (_ bv2148532224 32)) (_ bv0 32))) (not (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|))))))) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (fp.lt (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (= .cse3 ULTIMATE.start_main_~y~0) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~hy~1) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0))) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_9_4))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6)))))) (= (fp.neg .cse3) |ULTIMATE.start___ieee754_pow_#res|)))) [2019-11-20 06:47:38,287 INFO L444 ceAbstractionStarter]: For program point L295(lines 295 308) no Hoare annotation was computed. [2019-11-20 06:47:38,287 INFO L444 ceAbstractionStarter]: For program point L163(lines 163 164) no Hoare annotation was computed. [2019-11-20 06:47:38,287 INFO L444 ceAbstractionStarter]: For program point L163-2(lines 163 164) no Hoare annotation was computed. [2019-11-20 06:47:38,287 INFO L444 ceAbstractionStarter]: For program point L495(lines 495 500) no Hoare annotation was computed. [2019-11-20 06:47:38,288 INFO L444 ceAbstractionStarter]: For program point L363(line 363) no Hoare annotation was computed. [2019-11-20 06:47:38,288 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 308) no Hoare annotation was computed. [2019-11-20 06:47:38,288 INFO L444 ceAbstractionStarter]: For program point L363-2(line 363) no Hoare annotation was computed. [2019-11-20 06:47:38,288 INFO L444 ceAbstractionStarter]: For program point L364(lines 364 365) no Hoare annotation was computed. [2019-11-20 06:47:38,288 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 167) no Hoare annotation was computed. [2019-11-20 06:47:38,288 INFO L444 ceAbstractionStarter]: For program point L166-2(lines 166 167) no Hoare annotation was computed. [2019-11-20 06:47:38,288 INFO L444 ceAbstractionStarter]: For program point L365(line 365) no Hoare annotation was computed. [2019-11-20 06:47:38,289 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 307) no Hoare annotation was computed. [2019-11-20 06:47:38,289 INFO L444 ceAbstractionStarter]: For program point L365-2(line 365) no Hoare annotation was computed. [2019-11-20 06:47:38,289 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 101 106) no Hoare annotation was computed. [2019-11-20 06:47:38,289 INFO L440 ceAbstractionStarter]: At program point L101-2(lines 101 106) the Hoare annotation is: false [2019-11-20 06:47:38,289 INFO L440 ceAbstractionStarter]: At program point L35(lines 17 36) the Hoare annotation is: false [2019-11-20 06:47:38,289 INFO L444 ceAbstractionStarter]: For program point L101-3(lines 95 203) no Hoare annotation was computed. [2019-11-20 06:47:38,290 INFO L440 ceAbstractionStarter]: At program point L35-1(lines 17 36) the Hoare annotation is: false [2019-11-20 06:47:38,297 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 06:47:38,301 INFO L168 Benchmark]: Toolchain (without parser) took 111388.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.5 MB). Free memory was 956.4 MB in the beginning and 988.0 MB in the end (delta: -31.6 MB). Peak memory consumption was 239.0 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:38,302 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 06:47:38,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:38,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:38,303 INFO L168 Benchmark]: Boogie Preprocessor took 164.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:38,304 INFO L168 Benchmark]: RCFGBuilder took 47041.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.3 MB in the end (delta: 118.2 MB). Peak memory consumption was 118.2 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:38,304 INFO L168 Benchmark]: TraceAbstraction took 63520.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 998.3 MB in the beginning and 988.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 125.1 MB. Max. memory is 11.5 GB. [2019-11-20 06:47:38,307 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 571.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 164.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 47041.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.3 MB in the end (delta: 118.2 MB). Peak memory consumption was 118.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63520.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 998.3 MB in the beginning and 988.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 125.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 595]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 0 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...